./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-92.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 117c6decd6762b62195368e5a395459a67c828d30a0a9abafd54336b31d07e67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:10:27,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:10:27,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:10:27,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:10:27,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:10:27,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:10:27,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:10:27,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:10:27,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:10:27,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:10:27,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:10:27,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:10:27,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:10:27,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:10:27,956 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:10:27,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:10:27,957 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:10:27,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:10:27,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:10:27,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:10:27,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:10:27,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:10:27,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:10:27,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:10:27,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:10:27,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:10:27,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:10:27,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:10:27,960 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 -> 117c6decd6762b62195368e5a395459a67c828d30a0a9abafd54336b31d07e67 [2025-03-08 12:10:28,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:10:28,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:10:28,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:10:28,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:10:28,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:10:28,206 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-pe-co_file-92.i [2025-03-08 12:10:29,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf58639f/a2ca1d98695048e38bd1d573f5a4f418/FLAGd9727cf7e [2025-03-08 12:10:29,689 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:10:29,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-92.i [2025-03-08 12:10:29,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf58639f/a2ca1d98695048e38bd1d573f5a4f418/FLAGd9727cf7e [2025-03-08 12:10:29,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf58639f/a2ca1d98695048e38bd1d573f5a4f418 [2025-03-08 12:10:29,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:10:29,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:10:29,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:10:29,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:10:29,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:10:29,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:29,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c778d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29, skipping insertion in model container [2025-03-08 12:10:29,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:29,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:10:29,873 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-pe-co_file-92.i[919,932] [2025-03-08 12:10:29,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:10:29,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:10:29,943 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-pe-co_file-92.i[919,932] [2025-03-08 12:10:29,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:10:29,983 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:10:29,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29 WrapperNode [2025-03-08 12:10:29,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:10:29,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:10:29,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:10:29,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:10:29,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,049 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2025-03-08 12:10:30,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:10:30,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:10:30,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:10:30,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:10:30,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,088 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:10:30,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:10:30,104 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:10:30,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:10:30,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:10:30,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (1/1) ... [2025-03-08 12:10:30,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:10:30,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:10:30,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:10:30,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:10:30,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:10:30,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:10:30,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:10:30,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:10:30,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:10:30,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:10:30,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:10:30,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:10:30,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: havoc property_#t~bitwise26#1;havoc property_#t~short27#1; [2025-03-08 12:10:30,581 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 12:10:30,581 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:10:30,603 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:10:30,603 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:10:30,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:10:30 BoogieIcfgContainer [2025-03-08 12:10:30,604 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:10:30,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:10:30,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:10:30,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:10:30,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:10:29" (1/3) ... [2025-03-08 12:10:30,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a945b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:10:30, skipping insertion in model container [2025-03-08 12:10:30,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:10:29" (2/3) ... [2025-03-08 12:10:30,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a945b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:10:30, skipping insertion in model container [2025-03-08 12:10:30,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:10:30" (3/3) ... [2025-03-08 12:10:30,611 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-92.i [2025-03-08 12:10:30,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:10:30,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-92.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:10:30,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:10:30,687 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;@7b634f2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:10:30,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:10:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:10:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 12:10:30,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:30,704 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:30,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash -200418626, now seen corresponding path program 1 times [2025-03-08 12:10:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122024738] [2025-03-08 12:10:30,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:30,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 12:10:30,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 12:10:30,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:30,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122024738] [2025-03-08 12:10:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122024738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:10:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459210887] [2025-03-08 12:10:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:31,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:10:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:31,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:10:31,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:10:31,402 INFO L87 Difference]: Start difference. First operand has 110 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:31,482 INFO L93 Difference]: Finished difference Result 215 states and 378 transitions. [2025-03-08 12:10:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:10:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2025-03-08 12:10:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:31,492 INFO L225 Difference]: With dead ends: 215 [2025-03-08 12:10:31,492 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 12:10:31,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:10:31,499 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:31,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:10:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 12:10:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 12:10:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:10:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 169 transitions. [2025-03-08 12:10:31,542 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 169 transitions. Word has length 223 [2025-03-08 12:10:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:31,545 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 169 transitions. [2025-03-08 12:10:31,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 169 transitions. [2025-03-08 12:10:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 12:10:31,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:31,550 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:31,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 12:10:31,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash -354203019, now seen corresponding path program 1 times [2025-03-08 12:10:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:31,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799131708] [2025-03-08 12:10:31,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:31,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:31,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 12:10:31,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 12:10:31,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:31,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:32,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:32,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799131708] [2025-03-08 12:10:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799131708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:10:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061598259] [2025-03-08 12:10:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:10:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:32,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:10:32,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:10:32,005 INFO L87 Difference]: Start difference. First operand 108 states and 169 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:32,507 INFO L93 Difference]: Finished difference Result 349 states and 541 transitions. [2025-03-08 12:10:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:10:32,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2025-03-08 12:10:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:32,511 INFO L225 Difference]: With dead ends: 349 [2025-03-08 12:10:32,511 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 12:10:32,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:10:32,513 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 198 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:32,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 625 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:10:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 12:10:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 187. [2025-03-08 12:10:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 125 states have (on average 1.4) internal successors, (175), 126 states have internal predecessors, (175), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 12:10:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 293 transitions. [2025-03-08 12:10:32,549 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 293 transitions. Word has length 224 [2025-03-08 12:10:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:32,550 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 293 transitions. [2025-03-08 12:10:32,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 293 transitions. [2025-03-08 12:10:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 12:10:32,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:32,553 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:32,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:10:32,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:32,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1388607316, now seen corresponding path program 1 times [2025-03-08 12:10:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:32,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858028997] [2025-03-08 12:10:32,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:32,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 12:10:32,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 12:10:32,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:32,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858028997] [2025-03-08 12:10:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858028997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:32,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:10:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504253397] [2025-03-08 12:10:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:10:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:32,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:10:32,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:10:32,912 INFO L87 Difference]: Start difference. First operand 187 states and 293 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:33,705 INFO L93 Difference]: Finished difference Result 751 states and 1170 transitions. [2025-03-08 12:10:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:10:33,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2025-03-08 12:10:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:33,711 INFO L225 Difference]: With dead ends: 751 [2025-03-08 12:10:33,711 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 12:10:33,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:10:33,713 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 306 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:33,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 945 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:10:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 12:10:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 289. [2025-03-08 12:10:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 190 states have (on average 1.3736842105263158) internal successors, (261), 192 states have internal predecessors, (261), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-08 12:10:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 449 transitions. [2025-03-08 12:10:33,794 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 449 transitions. Word has length 224 [2025-03-08 12:10:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:33,794 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 449 transitions. [2025-03-08 12:10:33,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 449 transitions. [2025-03-08 12:10:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 12:10:33,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:33,797 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:33,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:10:33,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:33,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1192093811, now seen corresponding path program 1 times [2025-03-08 12:10:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888516116] [2025-03-08 12:10:33,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:33,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 12:10:33,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 12:10:33,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:33,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:34,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888516116] [2025-03-08 12:10:34,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888516116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:34,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:34,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:10:34,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585734566] [2025-03-08 12:10:34,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:34,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:10:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:34,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:10:34,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:10:34,150 INFO L87 Difference]: Start difference. First operand 289 states and 449 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:34,442 INFO L93 Difference]: Finished difference Result 760 states and 1182 transitions. [2025-03-08 12:10:34,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:10:34,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2025-03-08 12:10:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:34,447 INFO L225 Difference]: With dead ends: 760 [2025-03-08 12:10:34,448 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 12:10:34,449 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-08 12:10:34,450 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 163 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:34,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 595 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:10:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 12:10:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 393. [2025-03-08 12:10:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 258 states have (on average 1.375968992248062) internal successors, (355), 260 states have internal predecessors, (355), 129 states have call successors, (129), 5 states have call predecessors, (129), 5 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-08 12:10:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 613 transitions. [2025-03-08 12:10:34,492 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 613 transitions. Word has length 224 [2025-03-08 12:10:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:34,493 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 613 transitions. [2025-03-08 12:10:34,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 613 transitions. [2025-03-08 12:10:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 12:10:34,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:34,496 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:34,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:10:34,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:34,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:34,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1250079426, now seen corresponding path program 1 times [2025-03-08 12:10:34,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:34,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345772703] [2025-03-08 12:10:34,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:34,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:34,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 12:10:34,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 12:10:34,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:34,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:34,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:34,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345772703] [2025-03-08 12:10:34,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345772703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:34,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:10:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720216761] [2025-03-08 12:10:34,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:34,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:10:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:34,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:10:34,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:10:34,807 INFO L87 Difference]: Start difference. First operand 393 states and 613 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:35,208 INFO L93 Difference]: Finished difference Result 778 states and 1208 transitions. [2025-03-08 12:10:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:10:35,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 12:10:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:35,212 INFO L225 Difference]: With dead ends: 778 [2025-03-08 12:10:35,212 INFO L226 Difference]: Without dead ends: 492 [2025-03-08 12:10:35,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:10:35,214 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 340 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:35,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 671 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:10:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-08 12:10:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 404. [2025-03-08 12:10:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 269 states have (on average 1.3903345724907064) internal successors, (374), 271 states have internal predecessors, (374), 129 states have call successors, (129), 5 states have call predecessors, (129), 5 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-08 12:10:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 632 transitions. [2025-03-08 12:10:35,270 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 632 transitions. Word has length 225 [2025-03-08 12:10:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:35,270 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 632 transitions. [2025-03-08 12:10:35,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 632 transitions. [2025-03-08 12:10:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 12:10:35,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:35,272 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:35,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:10:35,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:35,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -589620411, now seen corresponding path program 1 times [2025-03-08 12:10:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104919122] [2025-03-08 12:10:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:35,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 12:10:35,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 12:10:35,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:35,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:35,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:35,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104919122] [2025-03-08 12:10:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104919122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:35,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:35,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:10:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74677829] [2025-03-08 12:10:35,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:35,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:10:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:35,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:10:35,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:10:35,558 INFO L87 Difference]: Start difference. First operand 404 states and 632 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:36,360 INFO L93 Difference]: Finished difference Result 1150 states and 1776 transitions. [2025-03-08 12:10:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:10:36,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 12:10:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:36,366 INFO L225 Difference]: With dead ends: 1150 [2025-03-08 12:10:36,366 INFO L226 Difference]: Without dead ends: 853 [2025-03-08 12:10:36,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:10:36,369 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 594 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:36,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 452 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:10:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-08 12:10:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 453. [2025-03-08 12:10:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 293 states have (on average 1.378839590443686) internal successors, (404), 296 states have internal predecessors, (404), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 150 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-08 12:10:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 710 transitions. [2025-03-08 12:10:36,439 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 710 transitions. Word has length 225 [2025-03-08 12:10:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:36,439 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 710 transitions. [2025-03-08 12:10:36,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 710 transitions. [2025-03-08 12:10:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 12:10:36,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:36,442 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:36,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:10:36,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:36,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1153189924, now seen corresponding path program 1 times [2025-03-08 12:10:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:36,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562327252] [2025-03-08 12:10:36,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:36,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 12:10:36,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 12:10:36,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:36,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:36,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562327252] [2025-03-08 12:10:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562327252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:36,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:36,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:10:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53244324] [2025-03-08 12:10:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:36,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:10:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:36,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:10:36,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:10:36,735 INFO L87 Difference]: Start difference. First operand 453 states and 710 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:38,244 INFO L93 Difference]: Finished difference Result 1404 states and 2177 transitions. [2025-03-08 12:10:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:10:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 12:10:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:38,253 INFO L225 Difference]: With dead ends: 1404 [2025-03-08 12:10:38,253 INFO L226 Difference]: Without dead ends: 1099 [2025-03-08 12:10:38,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:10:38,256 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 782 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:38,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1195 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 12:10:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-08 12:10:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 463. [2025-03-08 12:10:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 303 states have (on average 1.386138613861386) internal successors, (420), 306 states have internal predecessors, (420), 153 states have call successors, (153), 6 states have call predecessors, (153), 6 states have return successors, (153), 150 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-08 12:10:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 726 transitions. [2025-03-08 12:10:38,331 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 726 transitions. Word has length 225 [2025-03-08 12:10:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:38,331 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 726 transitions. [2025-03-08 12:10:38,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 726 transitions. [2025-03-08 12:10:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 12:10:38,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:38,337 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:10:38,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash -786133916, now seen corresponding path program 1 times [2025-03-08 12:10:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496835592] [2025-03-08 12:10:38,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:38,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 12:10:38,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 12:10:38,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:38,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496835592] [2025-03-08 12:10:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496835592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:39,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:10:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860873095] [2025-03-08 12:10:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:39,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:10:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:39,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:10:39,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:10:39,420 INFO L87 Difference]: Start difference. First operand 463 states and 726 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:41,048 INFO L93 Difference]: Finished difference Result 1682 states and 2553 transitions. [2025-03-08 12:10:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 12:10:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 12:10:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:41,058 INFO L225 Difference]: With dead ends: 1682 [2025-03-08 12:10:41,058 INFO L226 Difference]: Without dead ends: 1367 [2025-03-08 12:10:41,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:10:41,060 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 663 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:41,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1045 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 12:10:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-03-08 12:10:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1094. [2025-03-08 12:10:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 858 states have (on average 1.456876456876457) internal successors, (1250), 871 states have internal predecessors, (1250), 217 states have call successors, (217), 18 states have call predecessors, (217), 18 states have return successors, (217), 204 states have call predecessors, (217), 217 states have call successors, (217) [2025-03-08 12:10:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1684 transitions. [2025-03-08 12:10:41,183 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1684 transitions. Word has length 225 [2025-03-08 12:10:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:41,185 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1684 transitions. [2025-03-08 12:10:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1684 transitions. [2025-03-08 12:10:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 12:10:41,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:41,187 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:41,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:10:41,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash 917931398, now seen corresponding path program 1 times [2025-03-08 12:10:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640784899] [2025-03-08 12:10:41,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:41,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 12:10:41,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 12:10:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:42,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640784899] [2025-03-08 12:10:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640784899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:42,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 12:10:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018453053] [2025-03-08 12:10:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:42,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 12:10:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:42,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 12:10:42,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:10:42,946 INFO L87 Difference]: Start difference. First operand 1094 states and 1684 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:45,471 INFO L93 Difference]: Finished difference Result 3900 states and 5906 transitions. [2025-03-08 12:10:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 12:10:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 12:10:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:45,482 INFO L225 Difference]: With dead ends: 3900 [2025-03-08 12:10:45,482 INFO L226 Difference]: Without dead ends: 2850 [2025-03-08 12:10:45,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2025-03-08 12:10:45,486 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1376 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:45,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 783 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 12:10:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2025-03-08 12:10:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 1172. [2025-03-08 12:10:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 922 states have (on average 1.4555314533622559) internal successors, (1342), 934 states have internal predecessors, (1342), 228 states have call successors, (228), 21 states have call predecessors, (228), 21 states have return successors, (228), 216 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-08 12:10:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1798 transitions. [2025-03-08 12:10:45,593 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1798 transitions. Word has length 225 [2025-03-08 12:10:45,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:45,593 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1798 transitions. [2025-03-08 12:10:45,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1798 transitions. [2025-03-08 12:10:45,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 12:10:45,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:45,596 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:45,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:10:45,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:45,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1634225563, now seen corresponding path program 1 times [2025-03-08 12:10:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:45,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791091811] [2025-03-08 12:10:45,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:45,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 12:10:45,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 12:10:45,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:45,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:46,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791091811] [2025-03-08 12:10:46,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791091811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:46,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:46,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:10:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323890195] [2025-03-08 12:10:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:46,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:10:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:46,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:10:46,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:10:46,107 INFO L87 Difference]: Start difference. First operand 1172 states and 1798 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:46,527 INFO L93 Difference]: Finished difference Result 2578 states and 3965 transitions. [2025-03-08 12:10:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:10:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 225 [2025-03-08 12:10:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:46,535 INFO L225 Difference]: With dead ends: 2578 [2025-03-08 12:10:46,536 INFO L226 Difference]: Without dead ends: 1528 [2025-03-08 12:10:46,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:10:46,539 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 118 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:46,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 498 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:10:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-03-08 12:10:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1424. [2025-03-08 12:10:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1174 states have (on average 1.48381601362862) internal successors, (1742), 1186 states have internal predecessors, (1742), 228 states have call successors, (228), 21 states have call predecessors, (228), 21 states have return successors, (228), 216 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-08 12:10:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2198 transitions. [2025-03-08 12:10:46,655 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2198 transitions. Word has length 225 [2025-03-08 12:10:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:46,656 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2198 transitions. [2025-03-08 12:10:46,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2198 transitions. [2025-03-08 12:10:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 12:10:46,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:46,660 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:46,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:10:46,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:46,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash 837378564, now seen corresponding path program 1 times [2025-03-08 12:10:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954248979] [2025-03-08 12:10:46,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:46,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:10:46,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:10:46,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:46,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 60 proven. 42 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 12:10:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954248979] [2025-03-08 12:10:48,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954248979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:10:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613754294] [2025-03-08 12:10:48,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:48,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:10:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:10:48,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:10:48,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:10:48,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:10:48,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:10:48,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:48,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:48,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:10:48,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:10:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1194 proven. 42 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-03-08 12:10:48,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:10:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 60 proven. 42 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 12:10:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613754294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:10:48,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:10:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6, 6] total 27 [2025-03-08 12:10:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809030358] [2025-03-08 12:10:48,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:10:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 12:10:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:48,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 12:10:48,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-03-08 12:10:48,646 INFO L87 Difference]: Start difference. First operand 1424 states and 2198 transitions. Second operand has 27 states, 27 states have (on average 4.851851851851852) internal successors, (131), 27 states have internal predecessors, (131), 6 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 6 states have call predecessors, (85), 6 states have call successors, (85) [2025-03-08 12:10:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:53,814 INFO L93 Difference]: Finished difference Result 6313 states and 9317 transitions. [2025-03-08 12:10:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-08 12:10:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.851851851851852) internal successors, (131), 27 states have internal predecessors, (131), 6 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 6 states have call predecessors, (85), 6 states have call successors, (85) Word has length 227 [2025-03-08 12:10:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:53,831 INFO L225 Difference]: With dead ends: 6313 [2025-03-08 12:10:53,831 INFO L226 Difference]: Without dead ends: 5006 [2025-03-08 12:10:53,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2648 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1378, Invalid=6994, Unknown=0, NotChecked=0, Total=8372 [2025-03-08 12:10:53,837 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 3049 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3071 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:53,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3071 Valid, 1349 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 12:10:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5006 states. [2025-03-08 12:10:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5006 to 1601. [2025-03-08 12:10:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1346 states have (on average 1.4903417533432393) internal successors, (2006), 1358 states have internal predecessors, (2006), 228 states have call successors, (228), 26 states have call predecessors, (228), 26 states have return successors, (228), 216 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-08 12:10:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2462 transitions. [2025-03-08 12:10:54,004 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2462 transitions. Word has length 227 [2025-03-08 12:10:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:54,005 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2462 transitions. [2025-03-08 12:10:54,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.851851851851852) internal successors, (131), 27 states have internal predecessors, (131), 6 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 6 states have call predecessors, (85), 6 states have call successors, (85) [2025-03-08 12:10:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2462 transitions. [2025-03-08 12:10:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 12:10:54,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:54,008 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:54,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:10:54,212 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,SelfDestructingSolverStorable10 [2025-03-08 12:10:54,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:54,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:54,214 INFO L85 PathProgramCache]: Analyzing trace with hash -355828607, now seen corresponding path program 1 times [2025-03-08 12:10:54,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:54,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311025847] [2025-03-08 12:10:54,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:54,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:54,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:10:54,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:10:54,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:54,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:54,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311025847] [2025-03-08 12:10:54,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311025847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:54,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 12:10:54,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731303979] [2025-03-08 12:10:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:54,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:10:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:54,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:10:54,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:10:54,480 INFO L87 Difference]: Start difference. First operand 1601 states and 2462 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:10:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:56,538 INFO L93 Difference]: Finished difference Result 4862 states and 7429 transitions. [2025-03-08 12:10:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:10:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 227 [2025-03-08 12:10:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:56,550 INFO L225 Difference]: With dead ends: 4862 [2025-03-08 12:10:56,550 INFO L226 Difference]: Without dead ends: 3595 [2025-03-08 12:10:56,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:10:56,553 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 611 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:56,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1770 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 12:10:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2025-03-08 12:10:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 2469. [2025-03-08 12:10:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2040 states have (on average 1.4808823529411765) internal successors, (3021), 2058 states have internal predecessors, (3021), 389 states have call successors, (389), 39 states have call predecessors, (389), 39 states have return successors, (389), 371 states have call predecessors, (389), 389 states have call successors, (389) [2025-03-08 12:10:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3799 transitions. [2025-03-08 12:10:56,771 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3799 transitions. Word has length 227 [2025-03-08 12:10:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:56,771 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 3799 transitions. [2025-03-08 12:10:56,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:10:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3799 transitions. [2025-03-08 12:10:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:10:56,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:56,773 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:56,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:10:56,773 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:56,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash -326418061, now seen corresponding path program 1 times [2025-03-08 12:10:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:56,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593068486] [2025-03-08 12:10:56,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:56,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:10:56,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:10:56,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:56,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:10:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593068486] [2025-03-08 12:10:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593068486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:10:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:10:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:10:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385225888] [2025-03-08 12:10:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:10:57,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:10:57,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:57,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:10:57,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:10:57,293 INFO L87 Difference]: Start difference. First operand 2469 states and 3799 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:10:58,255 INFO L93 Difference]: Finished difference Result 4098 states and 6267 transitions. [2025-03-08 12:10:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:10:58,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2025-03-08 12:10:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:10:58,265 INFO L225 Difference]: With dead ends: 4098 [2025-03-08 12:10:58,265 INFO L226 Difference]: Without dead ends: 2764 [2025-03-08 12:10:58,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:10:58,268 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 218 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:10:58,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 726 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:10:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-03-08 12:10:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2469. [2025-03-08 12:10:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2040 states have (on average 1.478921568627451) internal successors, (3017), 2058 states have internal predecessors, (3017), 389 states have call successors, (389), 39 states have call predecessors, (389), 39 states have return successors, (389), 371 states have call predecessors, (389), 389 states have call successors, (389) [2025-03-08 12:10:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3795 transitions. [2025-03-08 12:10:58,478 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3795 transitions. Word has length 228 [2025-03-08 12:10:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:10:58,479 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 3795 transitions. [2025-03-08 12:10:58,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:10:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3795 transitions. [2025-03-08 12:10:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:10:58,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:10:58,480 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:10:58,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 12:10:58,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:10:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:10:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1170889932, now seen corresponding path program 1 times [2025-03-08 12:10:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:10:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472069274] [2025-03-08 12:10:58,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:10:58,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:10:58,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:10:58,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:58,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 12:10:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:10:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472069274] [2025-03-08 12:10:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472069274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:10:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939848228] [2025-03-08 12:10:59,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:10:59,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:10:59,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:10:59,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:10:59,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:10:59,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:10:59,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:10:59,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:10:59,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:10:59,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 12:10:59,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:10:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1194 proven. 42 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-03-08 12:10:59,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:10:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 60 proven. 42 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-08 12:10:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939848228] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:10:59,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:10:59,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2025-03-08 12:10:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231959216] [2025-03-08 12:10:59,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:10:59,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 12:10:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:10:59,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 12:10:59,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-08 12:10:59,606 INFO L87 Difference]: Start difference. First operand 2469 states and 3795 transitions. Second operand has 22 states, 22 states have (on average 6.409090909090909) internal successors, (141), 22 states have internal predecessors, (141), 5 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2025-03-08 12:11:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:11:02,899 INFO L93 Difference]: Finished difference Result 6158 states and 9154 transitions. [2025-03-08 12:11:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-08 12:11:02,900 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.409090909090909) internal successors, (141), 22 states have internal predecessors, (141), 5 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) Word has length 228 [2025-03-08 12:11:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:11:02,913 INFO L225 Difference]: With dead ends: 6158 [2025-03-08 12:11:02,913 INFO L226 Difference]: Without dead ends: 4323 [2025-03-08 12:11:02,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1039, Invalid=5767, Unknown=0, NotChecked=0, Total=6806 [2025-03-08 12:11:02,917 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1388 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:11:02,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 1763 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 12:11:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2025-03-08 12:11:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 2492. [2025-03-08 12:11:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2007 states have (on average 1.4539113104135526) internal successors, (2918), 2027 states have internal predecessors, (2918), 437 states have call successors, (437), 47 states have call predecessors, (437), 47 states have return successors, (437), 417 states have call predecessors, (437), 437 states have call successors, (437) [2025-03-08 12:11:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3792 transitions. [2025-03-08 12:11:03,178 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3792 transitions. Word has length 228 [2025-03-08 12:11:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:11:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 3792 transitions. [2025-03-08 12:11:03,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.409090909090909) internal successors, (141), 22 states have internal predecessors, (141), 5 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2025-03-08 12:11:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3792 transitions. [2025-03-08 12:11:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:11:03,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:11:03,183 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:11:03,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 12:11:03,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 12:11:03,383 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:11:03,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:11:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 355811541, now seen corresponding path program 1 times [2025-03-08 12:11:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:11:03,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646463773] [2025-03-08 12:11:03,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:11:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:11:03,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:11:03,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:11:03,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:11:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:11:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:11:05,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646463773] [2025-03-08 12:11:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646463773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:11:05,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:11:05,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 12:11:05,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583853160] [2025-03-08 12:11:05,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:11:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 12:11:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:11:05,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 12:11:05,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:11:05,101 INFO L87 Difference]: Start difference. First operand 2492 states and 3792 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 12:11:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:11:07,558 INFO L93 Difference]: Finished difference Result 4778 states and 7191 transitions. [2025-03-08 12:11:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 12:11:07,559 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 228 [2025-03-08 12:11:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:11:07,576 INFO L225 Difference]: With dead ends: 4778 [2025-03-08 12:11:07,576 INFO L226 Difference]: Without dead ends: 3453 [2025-03-08 12:11:07,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2025-03-08 12:11:07,581 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 868 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:11:07,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1015 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 12:11:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2025-03-08 12:11:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 2538. [2025-03-08 12:11:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2052 states have (on average 1.4532163742690059) internal successors, (2982), 2072 states have internal predecessors, (2982), 437 states have call successors, (437), 48 states have call predecessors, (437), 48 states have return successors, (437), 417 states have call predecessors, (437), 437 states have call successors, (437) [2025-03-08 12:11:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3856 transitions. [2025-03-08 12:11:07,847 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3856 transitions. Word has length 228 [2025-03-08 12:11:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:11:07,848 INFO L471 AbstractCegarLoop]: Abstraction has 2538 states and 3856 transitions. [2025-03-08 12:11:07,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-03-08 12:11:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3856 transitions. [2025-03-08 12:11:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:11:07,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:11:07,850 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:11:07,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 12:11:07,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:11:07,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:11:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1955014404, now seen corresponding path program 1 times [2025-03-08 12:11:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:11:07,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762265088] [2025-03-08 12:11:07,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:11:07,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:11:07,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:11:07,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:11:07,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:07,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:11:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:11:07,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:11:07,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762265088] [2025-03-08 12:11:07,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762265088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:11:07,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:11:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:11:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558796177] [2025-03-08 12:11:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:11:07,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:11:07,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:11:07,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:11:07,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:11:07,901 INFO L87 Difference]: Start difference. First operand 2538 states and 3856 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:11:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:11:08,176 INFO L93 Difference]: Finished difference Result 4724 states and 7186 transitions. [2025-03-08 12:11:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:11:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 228 [2025-03-08 12:11:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:11:08,184 INFO L225 Difference]: With dead ends: 4724 [2025-03-08 12:11:08,185 INFO L226 Difference]: Without dead ends: 2538 [2025-03-08 12:11:08,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:11:08,189 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:11:08,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:11:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2025-03-08 12:11:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2486. [2025-03-08 12:11:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2000 states have (on average 1.426) internal successors, (2852), 2020 states have internal predecessors, (2852), 437 states have call successors, (437), 48 states have call predecessors, (437), 48 states have return successors, (437), 417 states have call predecessors, (437), 437 states have call successors, (437) [2025-03-08 12:11:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3726 transitions. [2025-03-08 12:11:08,523 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3726 transitions. Word has length 228 [2025-03-08 12:11:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:11:08,524 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3726 transitions. [2025-03-08 12:11:08,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:11:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3726 transitions. [2025-03-08 12:11:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:11:08,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:11:08,526 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:11:08,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 12:11:08,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:11:08,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:11:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash 288804788, now seen corresponding path program 1 times [2025-03-08 12:11:08,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:11:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421597360] [2025-03-08 12:11:08,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:11:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:11:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:11:08,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:11:08,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:08,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:11:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853633424] [2025-03-08 12:11:08,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:11:08,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:11:08,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:11:08,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:11:08,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:11:08,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:11:08,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:11:08,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:08,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:11:08,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:11:08,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:11:08,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:11:08,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:08,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:11:08,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:11:08,875 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:11:08,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:11:08,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:11:09,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:11:09,081 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:11:09,203 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:11:09,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:11:09 BoogieIcfgContainer [2025-03-08 12:11:09,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:11:09,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:11:09,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:11:09,207 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:11:09,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:10:30" (3/4) ... [2025-03-08 12:11:09,209 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:11:09,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:11:09,210 INFO L158 Benchmark]: Toolchain (without parser) took 39483.92ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 114.5MB in the beginning and 257.2MB in the end (delta: -142.8MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. [2025-03-08 12:11:09,210 INFO L158 Benchmark]: CDTParser took 1.23ms. Allocated memory is still 226.5MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:11:09,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.51ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 98.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:11:09,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.90ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 93.8MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:11:09,211 INFO L158 Benchmark]: Boogie Preprocessor took 52.66ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 88.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:11:09,211 INFO L158 Benchmark]: IcfgBuilder took 499.74ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 54.5MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:11:09,211 INFO L158 Benchmark]: TraceAbstraction took 38600.42ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 54.0MB in the beginning and 257.3MB in the end (delta: -203.2MB). Peak memory consumption was 109.5MB. Max. memory is 16.1GB. [2025-03-08 12:11:09,211 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 453.0MB. Free memory was 257.3MB in the beginning and 257.2MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:11:09,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.23ms. Allocated memory is still 226.5MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.51ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 98.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.90ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 93.8MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.66ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 88.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 499.74ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 54.5MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38600.42ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 54.0MB in the beginning and 257.3MB in the end (delta: -203.2MB). Peak memory consumption was 109.5MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 453.0MB. Free memory was 257.3MB in the beginning and 257.2MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 205, overapproximation of someBinaryDOUBLEComparisonOperation at line 205, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 187. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned char var_1_27 = 5; [L42] unsigned short int var_1_28 = 16; [L43] unsigned short int var_1_29 = 200; [L44] signed short int var_1_30 = -256; [L45] signed short int var_1_32 = 8; [L46] unsigned short int var_1_33 = 128; [L47] double var_1_34 = 0.25; [L48] double var_1_35 = 5.75; [L49] signed long int var_1_36 = -32; [L50] unsigned char var_1_37 = 1; [L51] unsigned char var_1_38 = 0; [L52] unsigned char var_1_39 = 1; [L53] float var_1_40 = 2.6; [L54] unsigned char var_1_41 = 0; [L55] unsigned char var_1_42 = 0; [L56] unsigned short int last_1_var_1_1 = 100; [L57] unsigned long int last_1_var_1_12 = 8; [L58] double last_1_var_1_13 = 8.25; [L59] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L199] last_1_var_1_1 = var_1_1 [L200] last_1_var_1_12 = var_1_12 [L201] last_1_var_1_13 = var_1_13 [L202] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L146] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L150] var_1_8 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L152] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L153] var_1_9 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533] [L154] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533] [L155] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L155] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L156] var_1_10 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L157] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L158] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L159] var_1_11 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L160] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L162] var_1_14 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L163] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L164] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L165] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L166] var_1_15 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L167] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L168] var_1_18 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L169] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L170] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L170] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L171] var_1_19 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L172] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L173] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L174] var_1_21 = __VERIFIER_nondet_long() [L175] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L175] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L176] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L178] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L179] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L179] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L180] var_1_27 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L181] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L182] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L183] var_1_29 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L184] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L185] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L186] var_1_35 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L187] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L188] var_1_37 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L189] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L190] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L190] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L191] var_1_39 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L192] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L193] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L194] var_1_42 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L195] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L196] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L213] RET updateVariables() [L214] CALL step() [L63] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=0, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L64] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L75] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L77] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L77] COND TRUE (((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16 [L78] COND TRUE \read(var_1_7) [L79] var_1_12 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L82] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L83] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L84] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=65534, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L87] COND FALSE !((~ var_1_19) == stepLocal_4) [L90] var_1_20 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L93] unsigned char stepLocal_3 = var_1_6; [L94] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=0, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L95] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L100] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L102] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=65534, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=33/4, var_1_14=-1, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L103] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L104] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L108] COND TRUE (var_1_1 + var_1_12) > 16 [L109] var_1_23 = ((var_1_26 + 2) + var_1_27) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L117] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L118] COND FALSE !(var_1_20 < 2) [L121] var_1_30 = var_1_26 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L123] EXPR var_1_1 | var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L123] COND FALSE !((~ (var_1_1 | var_1_20)) >= (~ (~ 32))) [L126] EXPR var_1_17 >> var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L126] COND TRUE (var_1_17 >> var_1_20) <= var_1_17 [L127] COND TRUE var_1_16 > var_1_17 [L128] var_1_33 = ((((10000) > (var_1_16)) ? (10000) : (var_1_16))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L131] COND FALSE !(var_1_16 >= var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L136] COND TRUE ((var_1_20 - var_1_27) > var_1_16) && var_1_37 [L137] var_1_36 = ((((var_1_26) < (64)) ? (var_1_26) : (64))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_36=0, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L139] var_1_38 = var_1_39 [L140] var_1_40 = var_1_35 [L141] var_1_41 = var_1_42 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_35=3, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=3, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L214] RET step() [L215] CALL, EXPR property() [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_35=3, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=3, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L205] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_35=3, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=3, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_35=3, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=3, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L205-L206] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_35=3, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=3, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=65534, var_1_11=0, var_1_12=65534, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=65533, var_1_17=0, var_1_18=4, var_1_19=63, var_1_1=65534, var_1_20=65534, var_1_21=536870911, var_1_23=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=8, var_1_33=65533, var_1_34=1/4, var_1_35=3, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=1, var_1_40=3, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=65533, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 208 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.4s, OverallIterations: 17, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10718 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10674 mSDsluCounter, 14058 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10141 mSDsCounter, 3508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12786 IncrementalHoareTripleChecker+Invalid, 16294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3508 mSolverCounterUnsat, 3917 mSDtfsCounter, 12786 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1298 GetRequests, 990 SyntacticMatches, 1 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5040 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2538occurred in iteration=15, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 11218 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 4522 NumberOfCodeBlocks, 4522 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4501 ConstructedInterpolants, 0 QuantifiedInterpolants, 30871 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 47312/47600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:11:09,373 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-pe-co_file-92.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 117c6decd6762b62195368e5a395459a67c828d30a0a9abafd54336b31d07e67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:11:11,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:11:11,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:11:11,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:11:11,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:11:11,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:11:11,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:11:11,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:11:11,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:11:11,182 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:11:11,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:11:11,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:11:11,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:11:11,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:11:11,183 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:11:11,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:11:11,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:11:11,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:11:11,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:11:11,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:11:11,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:11:11,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:11:11,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:11:11,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:11:11,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:11:11,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:11:11,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:11:11,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:11:11,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:11:11,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:11:11,187 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 -> 117c6decd6762b62195368e5a395459a67c828d30a0a9abafd54336b31d07e67 [2025-03-08 12:11:11,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:11:11,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:11:11,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:11:11,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:11:11,431 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:11:11,431 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-pe-co_file-92.i [2025-03-08 12:11:12,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91302cdd7/7f9052beaf344dbd9c40b459ac4b346c/FLAGe63d9bab0 [2025-03-08 12:11:12,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:11:12,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-92.i [2025-03-08 12:11:12,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91302cdd7/7f9052beaf344dbd9c40b459ac4b346c/FLAGe63d9bab0 [2025-03-08 12:11:12,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91302cdd7/7f9052beaf344dbd9c40b459ac4b346c [2025-03-08 12:11:12,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:11:12,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:11:12,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:11:12,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:11:12,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:11:12,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:11:12" (1/1) ... [2025-03-08 12:11:12,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dc1453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:12, skipping insertion in model container [2025-03-08 12:11:12,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:11:12" (1/1) ... [2025-03-08 12:11:12,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:11:13,002 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-pe-co_file-92.i[919,932] [2025-03-08 12:11:13,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:11:13,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:11:13,106 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-pe-co_file-92.i[919,932] [2025-03-08 12:11:13,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:11:13,157 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:11:13,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13 WrapperNode [2025-03-08 12:11:13,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:11:13,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:11:13,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:11:13,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:11:13,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,204 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-03-08 12:11:13,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:11:13,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:11:13,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:11:13,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:11:13,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,225 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:11:13,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:11:13,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:11:13,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:11:13,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:11:13,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (1/1) ... [2025-03-08 12:11:13,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:11:13,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:11:13,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:11:13,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:11:13,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:11:13,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:11:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:11:13,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:11:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:11:13,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:11:13,387 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:11:13,389 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:11:13,831 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 12:11:13,832 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:11:13,845 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:11:13,845 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:11:13,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:11:13 BoogieIcfgContainer [2025-03-08 12:11:13,847 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:11:13,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:11:13,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:11:13,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:11:13,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:11:12" (1/3) ... [2025-03-08 12:11:13,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3f485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:11:13, skipping insertion in model container [2025-03-08 12:11:13,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:11:13" (2/3) ... [2025-03-08 12:11:13,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb3f485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:11:13, skipping insertion in model container [2025-03-08 12:11:13,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:11:13" (3/3) ... [2025-03-08 12:11:13,859 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-92.i [2025-03-08 12:11:13,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:11:13,871 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-92.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:11:13,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:11:13,924 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;@783206c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:11:13,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:11:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:11:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 12:11:13,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:11:13,941 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:11:13,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:11:13,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:11:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 595141979, now seen corresponding path program 1 times [2025-03-08 12:11:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:11:13,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095709720] [2025-03-08 12:11:13,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:11:13,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:11:13,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:11:13,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:11:13,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:11:14,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 12:11:14,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 12:11:14,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:14,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:11:14,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:11:14,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:11:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 1556 trivial. 0 not checked. [2025-03-08 12:11:14,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:11:14,293 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:11:14,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095709720] [2025-03-08 12:11:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095709720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:11:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:11:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:11:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454385757] [2025-03-08 12:11:14,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:11:14,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:11:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:11:14,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:11:14,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:11:14,316 INFO L87 Difference]: Start difference. First operand has 95 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:11:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:11:14,343 INFO L93 Difference]: Finished difference Result 184 states and 330 transitions. [2025-03-08 12:11:14,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:11:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2025-03-08 12:11:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:11:14,354 INFO L225 Difference]: With dead ends: 184 [2025-03-08 12:11:14,354 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 12:11:14,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:11:14,362 INFO L435 NwaCegarLoop]: 145 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, 145 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:11:14,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:11:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 12:11:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 12:11:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 12:11:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 145 transitions. [2025-03-08 12:11:14,410 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 145 transitions. Word has length 218 [2025-03-08 12:11:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:11:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 145 transitions. [2025-03-08 12:11:14,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-08 12:11:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 145 transitions. [2025-03-08 12:11:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 12:11:14,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:11:14,415 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:11:14,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:11:14,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:11:14,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:11:14,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:11:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1777321054, now seen corresponding path program 1 times [2025-03-08 12:11:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:11:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582825194] [2025-03-08 12:11:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:11:14,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:11:14,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:11:14,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:11:14,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:11:14,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 12:11:14,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 12:11:14,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:14,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:11:14,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:11:14,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:11:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-08 12:11:15,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:11:15,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:11:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582825194] [2025-03-08 12:11:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582825194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:11:15,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:11:15,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:11:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086887812] [2025-03-08 12:11:15,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:11:15,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:11:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:11:15,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:11:15,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:11:15,339 INFO L87 Difference]: Start difference. First operand 92 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:11:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:11:15,864 INFO L93 Difference]: Finished difference Result 289 states and 457 transitions. [2025-03-08 12:11:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:11:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2025-03-08 12:11:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:11:15,868 INFO L225 Difference]: With dead ends: 289 [2025-03-08 12:11:15,868 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 12:11:15,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:11:15,870 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 115 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:11:15,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 428 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:11:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 12:11:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2025-03-08 12:11:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 105 states have internal predecessors, (142), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 12:11:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 282 transitions. [2025-03-08 12:11:15,915 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 282 transitions. Word has length 218 [2025-03-08 12:11:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:11:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 282 transitions. [2025-03-08 12:11:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-08 12:11:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 282 transitions. [2025-03-08 12:11:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 12:11:15,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:11:15,922 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:11:15,932 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 (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:11:16,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:11:16,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:11:16,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:11:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1013286550, now seen corresponding path program 1 times [2025-03-08 12:11:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:11:16,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60085202] [2025-03-08 12:11:16,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:11:16,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:11:16,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:11:16,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:11:16,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:11:16,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 12:11:16,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 12:11:16,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:11:16,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:11:16,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 12:11:16,511 INFO L279 TraceCheckSpWp]: Computing forward predicates...