./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.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 e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:40:22,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:40:22,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:40:22,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:40:22,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:40:22,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:40:22,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:40:22,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:40:22,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:40:22,613 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:40:22,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:40:22,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:40:22,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:40:22,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:40:22,614 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:40:22,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:40:22,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:40:22,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:40:22,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:40:22,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:40:22,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:40:22,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:40:22,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:40:22,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:40:22,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:40:22,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:40:22,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:40:22,618 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 -> e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 [2025-03-17 01:40:22,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:40:22,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:40:22,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:40:22,867 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:40:22,868 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:40:22,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2025-03-17 01:40:24,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21daca7ee/6400aaf5b4754faca90e6fed9ea9016e/FLAGa95739ece [2025-03-17 01:40:24,296 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:40:24,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2025-03-17 01:40:24,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21daca7ee/6400aaf5b4754faca90e6fed9ea9016e/FLAGa95739ece [2025-03-17 01:40:24,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21daca7ee/6400aaf5b4754faca90e6fed9ea9016e [2025-03-17 01:40:24,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:40:24,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:40:24,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:40:24,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:40:24,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:40:24,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:24,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24, skipping insertion in model container [2025-03-17 01:40:24,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:24,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:40:24,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i[918,931] [2025-03-17 01:40:24,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:40:24,838 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:40:24,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i[918,931] [2025-03-17 01:40:24,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:40:24,910 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:40:24,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24 WrapperNode [2025-03-17 01:40:24,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:40:24,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:40:24,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:40:24,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:40:24,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:24,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:24,968 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 281 [2025-03-17 01:40:24,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:40:24,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:40:24,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:40:24,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:40:24,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:24,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:24,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,050 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:40:25,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,050 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:40:25,078 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:40:25,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:40:25,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:40:25,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (1/1) ... [2025-03-17 01:40:25,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:40:25,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:40:25,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:40:25,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:40:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:40:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:40:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:40:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:40:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:40:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:40:25,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:40:25,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:40:25,572 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: havoc property_#t~bitwise28#1;havoc property_#t~ite30#1;havoc property_#t~bitwise29#1;havoc property_#t~bitwise31#1;havoc property_#t~short32#1; [2025-03-17 01:40:25,612 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 01:40:25,613 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:40:25,629 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:40:25,630 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:40:25,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:40:25 BoogieIcfgContainer [2025-03-17 01:40:25,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:40:25,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:40:25,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:40:25,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:40:25,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:40:24" (1/3) ... [2025-03-17 01:40:25,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e05981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:40:25, skipping insertion in model container [2025-03-17 01:40:25,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:24" (2/3) ... [2025-03-17 01:40:25,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e05981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:40:25, skipping insertion in model container [2025-03-17 01:40:25,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:40:25" (3/3) ... [2025-03-17 01:40:25,638 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2025-03-17 01:40:25,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:40:25,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:40:25,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:40:25,696 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;@52edce03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:40:25,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:40:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 01:40:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-17 01:40:25,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:25,710 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:25,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:25,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1551379351, now seen corresponding path program 1 times [2025-03-17 01:40:25,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:25,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882556843] [2025-03-17 01:40:25,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:25,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-17 01:40:25,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-17 01:40:25,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:25,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:40:26,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:26,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882556843] [2025-03-17 01:40:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882556843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:40:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667209179] [2025-03-17 01:40:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:26,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:40:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:26,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:40:26,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:40:26,312 INFO L87 Difference]: Start difference. First operand has 120 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:40:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:26,378 INFO L93 Difference]: Finished difference Result 238 states and 419 transitions. [2025-03-17 01:40:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:40:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2025-03-17 01:40:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:26,388 INFO L225 Difference]: With dead ends: 238 [2025-03-17 01:40:26,389 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 01:40:26,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:40:26,398 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:26,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:40:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 01:40:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 01:40:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 01:40:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 187 transitions. [2025-03-17 01:40:26,443 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 187 transitions. Word has length 234 [2025-03-17 01:40:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:26,446 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 187 transitions. [2025-03-17 01:40:26,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:40:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 187 transitions. [2025-03-17 01:40:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-17 01:40:26,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:26,451 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 01:40:26,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:26,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1889843842, now seen corresponding path program 1 times [2025-03-17 01:40:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-03-17 01:40:26,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:26,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:26,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:26,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:26,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 33 proven. 75 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:40:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901872951] [2025-03-17 01:40:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901872951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:40:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595372449] [2025-03-17 01:40:31,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:31,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:40:31,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:40:31,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:40:31,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:40:31,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:31,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:31,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:31,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:31,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:40:31,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:40:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 548 proven. 108 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2025-03-17 01:40:32,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:40:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:40:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595372449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:40:32,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:40:32,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 21 [2025-03-17 01:40:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267562035] [2025-03-17 01:40:32,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:40:32,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 01:40:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 01:40:32,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-03-17 01:40:32,976 INFO L87 Difference]: Start difference. First operand 119 states and 187 transitions. Second operand has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 7 states have call successors, (110), 3 states have call predecessors, (110), 5 states have return successors, (111), 6 states have call predecessors, (111), 7 states have call successors, (111) [2025-03-17 01:40:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:36,396 INFO L93 Difference]: Finished difference Result 351 states and 545 transitions. [2025-03-17 01:40:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 01:40:36,397 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 7 states have call successors, (110), 3 states have call predecessors, (110), 5 states have return successors, (111), 6 states have call predecessors, (111), 7 states have call successors, (111) Word has length 235 [2025-03-17 01:40:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:36,402 INFO L225 Difference]: With dead ends: 351 [2025-03-17 01:40:36,403 INFO L226 Difference]: Without dead ends: 233 [2025-03-17 01:40:36,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2025-03-17 01:40:36,407 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 635 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:36,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 885 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 01:40:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-17 01:40:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 123. [2025-03-17 01:40:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 01:40:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2025-03-17 01:40:36,441 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 235 [2025-03-17 01:40:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:36,443 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2025-03-17 01:40:36,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.666666666666667) internal successors, (140), 21 states have internal predecessors, (140), 7 states have call successors, (110), 3 states have call predecessors, (110), 5 states have return successors, (111), 6 states have call predecessors, (111), 7 states have call successors, (111) [2025-03-17 01:40:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2025-03-17 01:40:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-17 01:40:36,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:36,448 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:36,456 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-17 01:40:36,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:40:36,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash -148212447, now seen corresponding path program 1 times [2025-03-17 01:40:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204421381] [2025-03-17 01:40:36,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:36,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:36,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:36,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:36,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:36,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 33 proven. 75 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:40:39,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204421381] [2025-03-17 01:40:39,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204421381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:40:39,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574348308] [2025-03-17 01:40:39,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:39,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:40:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:40:39,610 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-17 01:40:39,611 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-17 01:40:39,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:39,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:39,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:39,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:39,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 01:40:39,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:40:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1212 proven. 72 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-03-17 01:40:40,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:40:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:40:41,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574348308] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:40:41,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:40:41,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 11] total 24 [2025-03-17 01:40:41,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186441246] [2025-03-17 01:40:41,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:41,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:40:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:41,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:40:41,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:40:41,410 INFO L87 Difference]: Start difference. First operand 123 states and 189 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:40:47,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 01:40:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:47,271 INFO L93 Difference]: Finished difference Result 495 states and 758 transitions. [2025-03-17 01:40:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:40:47,272 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-17 01:40:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:47,275 INFO L225 Difference]: With dead ends: 495 [2025-03-17 01:40:47,275 INFO L226 Difference]: Without dead ends: 373 [2025-03-17 01:40:47,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:40:47,279 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 541 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:47,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 897 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 292 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-03-17 01:40:47,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-17 01:40:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 267. [2025-03-17 01:40:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 220 states have (on average 1.5045454545454546) internal successors, (331), 221 states have internal predecessors, (331), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 01:40:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 415 transitions. [2025-03-17 01:40:47,307 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 415 transitions. Word has length 235 [2025-03-17 01:40:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:47,308 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 415 transitions. [2025-03-17 01:40:47,308 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:40:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 415 transitions. [2025-03-17 01:40:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-17 01:40:47,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:47,310 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:47,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:40:47,510 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,SelfDestructingSolverStorable2 [2025-03-17 01:40:47,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:47,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 779352728, now seen corresponding path program 1 times [2025-03-17 01:40:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:47,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888394082] [2025-03-17 01:40:47,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:47,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:47,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:47,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:47,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:47,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 33 proven. 75 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:40:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:49,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888394082] [2025-03-17 01:40:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888394082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:40:49,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163276298] [2025-03-17 01:40:49,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:40:49,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:40:49,568 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-17 01:40:49,583 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-17 01:40:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:49,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:49,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:49,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:49,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 01:40:49,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:40:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1212 proven. 72 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-03-17 01:40:50,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:40:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:40:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163276298] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:40:51,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:40:51,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 22 [2025-03-17 01:40:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357265308] [2025-03-17 01:40:51,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:51,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:40:51,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:51,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:40:51,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:40:51,352 INFO L87 Difference]: Start difference. First operand 267 states and 415 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:40:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:52,693 INFO L93 Difference]: Finished difference Result 685 states and 1040 transitions. [2025-03-17 01:40:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:40:52,694 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-17 01:40:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:52,698 INFO L225 Difference]: With dead ends: 685 [2025-03-17 01:40:52,698 INFO L226 Difference]: Without dead ends: 419 [2025-03-17 01:40:52,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:40:52,700 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 552 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:52,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 945 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:40:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-17 01:40:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 269. [2025-03-17 01:40:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 222 states have (on average 1.5045045045045045) internal successors, (334), 223 states have internal predecessors, (334), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 01:40:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 418 transitions. [2025-03-17 01:40:52,723 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 418 transitions. Word has length 235 [2025-03-17 01:40:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:52,723 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 418 transitions. [2025-03-17 01:40:52,723 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:40:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 418 transitions. [2025-03-17 01:40:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-17 01:40:52,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:52,726 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:52,734 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-17 01:40:52,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:40:52,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2069545506, now seen corresponding path program 1 times [2025-03-17 01:40:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189650606] [2025-03-17 01:40:52,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:52,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:52,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:52,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 33 proven. 75 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:40:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189650606] [2025-03-17 01:40:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189650606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:40:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315324882] [2025-03-17 01:40:55,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:55,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:40:55,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:40:55,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:40:55,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 01:40:55,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:40:55,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:40:55,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:55,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 01:40:55,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:40:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 734 proven. 261 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2025-03-17 01:40:56,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:40:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 36 proven. 177 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2025-03-17 01:40:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315324882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:40:57,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:40:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2025-03-17 01:40:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392717962] [2025-03-17 01:40:57,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:40:57,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 01:40:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:57,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 01:40:57,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 01:40:57,573 INFO L87 Difference]: Start difference. First operand 269 states and 418 transitions. Second operand has 34 states, 33 states have (on average 4.606060606060606) internal successors, (152), 32 states have internal predecessors, (152), 9 states have call successors, (111), 5 states have call predecessors, (111), 9 states have return successors, (111), 9 states have call predecessors, (111), 9 states have call successors, (111) [2025-03-17 01:41:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:01,916 INFO L93 Difference]: Finished difference Result 853 states and 1283 transitions. [2025-03-17 01:41:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 01:41:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.606060606060606) internal successors, (152), 32 states have internal predecessors, (152), 9 states have call successors, (111), 5 states have call predecessors, (111), 9 states have return successors, (111), 9 states have call predecessors, (111), 9 states have call successors, (111) Word has length 235 [2025-03-17 01:41:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:01,920 INFO L225 Difference]: With dead ends: 853 [2025-03-17 01:41:01,920 INFO L226 Difference]: Without dead ends: 585 [2025-03-17 01:41:01,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=754, Invalid=3802, Unknown=0, NotChecked=0, Total=4556 [2025-03-17 01:41:01,922 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1585 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 3081 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:01,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 3081 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-17 01:41:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-17 01:41:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 428. [2025-03-17 01:41:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 332 states have (on average 1.4427710843373494) internal successors, (479), 334 states have internal predecessors, (479), 84 states have call successors, (84), 11 states have call predecessors, (84), 11 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 01:41:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 647 transitions. [2025-03-17 01:41:01,963 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 647 transitions. Word has length 235 [2025-03-17 01:41:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:01,965 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 647 transitions. [2025-03-17 01:41:01,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.606060606060606) internal successors, (152), 32 states have internal predecessors, (152), 9 states have call successors, (111), 5 states have call predecessors, (111), 9 states have return successors, (111), 9 states have call predecessors, (111), 9 states have call successors, (111) [2025-03-17 01:41:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 647 transitions. [2025-03-17 01:41:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-17 01:41:01,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:01,967 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:01,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 01:41:02,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:02,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:02,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:02,169 INFO L85 PathProgramCache]: Analyzing trace with hash -402948992, now seen corresponding path program 1 times [2025-03-17 01:41:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:02,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105376386] [2025-03-17 01:41:02,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:02,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:41:02,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:41:02,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:02,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 33 proven. 75 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:41:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:03,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105376386] [2025-03-17 01:41:03,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105376386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:41:03,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041876355] [2025-03-17 01:41:03,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:03,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:03,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:41:03,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:41:03,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 01:41:03,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:41:03,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:41:03,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:03,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:03,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 01:41:03,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:41:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1212 proven. 72 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-03-17 01:41:04,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:41:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:41:04,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041876355] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:41:04,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:41:04,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 11] total 24 [2025-03-17 01:41:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570301224] [2025-03-17 01:41:04,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:41:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:04,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:41:04,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-03-17 01:41:04,699 INFO L87 Difference]: Start difference. First operand 428 states and 647 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:05,771 INFO L93 Difference]: Finished difference Result 1020 states and 1534 transitions. [2025-03-17 01:41:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:41:05,774 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-17 01:41:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:05,778 INFO L225 Difference]: With dead ends: 1020 [2025-03-17 01:41:05,779 INFO L226 Difference]: Without dead ends: 593 [2025-03-17 01:41:05,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:41:05,781 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 452 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:05,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1306 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:41:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-17 01:41:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 467. [2025-03-17 01:41:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 371 states have (on average 1.45822102425876) internal successors, (541), 373 states have internal predecessors, (541), 84 states have call successors, (84), 11 states have call predecessors, (84), 11 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 01:41:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 709 transitions. [2025-03-17 01:41:05,815 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 709 transitions. Word has length 235 [2025-03-17 01:41:05,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:05,815 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 709 transitions. [2025-03-17 01:41:05,815 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 709 transitions. [2025-03-17 01:41:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-17 01:41:05,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:05,817 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:05,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 01:41:06,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:06,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash 524616183, now seen corresponding path program 1 times [2025-03-17 01:41:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60923159] [2025-03-17 01:41:06,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:06,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:41:06,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:41:06,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:06,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 33 proven. 75 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:41:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60923159] [2025-03-17 01:41:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60923159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:41:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282504525] [2025-03-17 01:41:06,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:06,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:06,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:41:06,710 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:41:06,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 01:41:06,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 01:41:06,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 01:41:06,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:06,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:06,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 01:41:06,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:41:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1212 proven. 72 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-03-17 01:41:07,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:41:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:41:08,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282504525] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 01:41:08,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:41:08,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 11] total 22 [2025-03-17 01:41:08,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257105772] [2025-03-17 01:41:08,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:08,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:41:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:08,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:41:08,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-17 01:41:08,052 INFO L87 Difference]: Start difference. First operand 467 states and 709 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:09,123 INFO L93 Difference]: Finished difference Result 1066 states and 1605 transitions. [2025-03-17 01:41:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 01:41:09,124 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-17 01:41:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:09,128 INFO L225 Difference]: With dead ends: 1066 [2025-03-17 01:41:09,129 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 01:41:09,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:41:09,131 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 409 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:09,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1151 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:41:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 01:41:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 506. [2025-03-17 01:41:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 410 states have (on average 1.4707317073170731) internal successors, (603), 412 states have internal predecessors, (603), 84 states have call successors, (84), 11 states have call predecessors, (84), 11 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 01:41:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 771 transitions. [2025-03-17 01:41:09,164 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 771 transitions. Word has length 235 [2025-03-17 01:41:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:09,165 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 771 transitions. [2025-03-17 01:41:09,165 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 771 transitions. [2025-03-17 01:41:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 01:41:09,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:09,167 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:09,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 01:41:09,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:09,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1524640129, now seen corresponding path program 1 times [2025-03-17 01:41:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325880975] [2025-03-17 01:41:09,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:09,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 01:41:09,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 01:41:09,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:09,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:41:09,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59064702] [2025-03-17 01:41:09,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:09,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:09,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:41:09,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:41:09,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 01:41:09,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 01:41:09,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 01:41:09,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:09,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:09,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 01:41:09,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:41:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 556 proven. 96 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2025-03-17 01:41:09,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:41:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-17 01:41:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325880975] [2025-03-17 01:41:10,269 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:41:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59064702] [2025-03-17 01:41:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59064702] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:41:10,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:41:10,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-17 01:41:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136603984] [2025-03-17 01:41:10,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:41:10,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:41:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:10,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:41:10,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:41:10,271 INFO L87 Difference]: Start difference. First operand 506 states and 771 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-17 01:41:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:11,268 INFO L93 Difference]: Finished difference Result 1285 states and 1897 transitions. [2025-03-17 01:41:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:41:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 237 [2025-03-17 01:41:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:11,275 INFO L225 Difference]: With dead ends: 1285 [2025-03-17 01:41:11,275 INFO L226 Difference]: Without dead ends: 780 [2025-03-17 01:41:11,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:41:11,277 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 469 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:11,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1028 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:41:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-17 01:41:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 549. [2025-03-17 01:41:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 457 states have (on average 1.4704595185995624) internal successors, (672), 459 states have internal predecessors, (672), 78 states have call successors, (78), 13 states have call predecessors, (78), 13 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 01:41:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 828 transitions. [2025-03-17 01:41:11,312 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 828 transitions. Word has length 237 [2025-03-17 01:41:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 828 transitions. [2025-03-17 01:41:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2025-03-17 01:41:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 828 transitions. [2025-03-17 01:41:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 01:41:11,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:11,314 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:11,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 01:41:11,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:11,515 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:11,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash 807262774, now seen corresponding path program 1 times [2025-03-17 01:41:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:11,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481742109] [2025-03-17 01:41:11,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:11,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 01:41:11,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 01:41:11,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:11,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:41:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481742109] [2025-03-17 01:41:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481742109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:41:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870414910] [2025-03-17 01:41:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:41:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:11,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:41:11,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:41:11,585 INFO L87 Difference]: Start difference. First operand 549 states and 828 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:11,666 INFO L93 Difference]: Finished difference Result 1282 states and 1915 transitions. [2025-03-17 01:41:11,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:41:11,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 237 [2025-03-17 01:41:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:11,670 INFO L225 Difference]: With dead ends: 1282 [2025-03-17 01:41:11,670 INFO L226 Difference]: Without dead ends: 734 [2025-03-17 01:41:11,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:41:11,673 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 160 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:11,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 367 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:41:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-17 01:41:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 712. [2025-03-17 01:41:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 535 states have (on average 1.3981308411214954) internal successors, (748), 539 states have internal predecessors, (748), 152 states have call successors, (152), 24 states have call predecessors, (152), 24 states have return successors, (152), 148 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-17 01:41:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1052 transitions. [2025-03-17 01:41:11,727 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1052 transitions. Word has length 237 [2025-03-17 01:41:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:11,728 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1052 transitions. [2025-03-17 01:41:11,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1052 transitions. [2025-03-17 01:41:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 01:41:11,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:11,730 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:11,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:41:11,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:11,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1030288760, now seen corresponding path program 1 times [2025-03-17 01:41:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957422558] [2025-03-17 01:41:11,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:11,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 01:41:11,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 01:41:11,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:11,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:41:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957422558] [2025-03-17 01:41:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957422558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:12,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 01:41:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90644472] [2025-03-17 01:41:12,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:12,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:41:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:12,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:41:12,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:41:12,353 INFO L87 Difference]: Start difference. First operand 712 states and 1052 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:13,094 INFO L93 Difference]: Finished difference Result 2159 states and 3071 transitions. [2025-03-17 01:41:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:41:13,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 237 [2025-03-17 01:41:13,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:13,104 INFO L225 Difference]: With dead ends: 2159 [2025-03-17 01:41:13,104 INFO L226 Difference]: Without dead ends: 1459 [2025-03-17 01:41:13,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 01:41:13,107 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 227 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:13,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1152 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 01:41:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-03-17 01:41:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1032. [2025-03-17 01:41:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 803 states have (on average 1.398505603985056) internal successors, (1123), 811 states have internal predecessors, (1123), 187 states have call successors, (187), 41 states have call predecessors, (187), 41 states have return successors, (187), 179 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-17 01:41:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1497 transitions. [2025-03-17 01:41:13,212 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1497 transitions. Word has length 237 [2025-03-17 01:41:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1497 transitions. [2025-03-17 01:41:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1497 transitions. [2025-03-17 01:41:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-17 01:41:13,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:13,215 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:13,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:41:13,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:13,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash -477765278, now seen corresponding path program 1 times [2025-03-17 01:41:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006320230] [2025-03-17 01:41:13,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:13,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 01:41:13,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 01:41:13,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:13,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:41:14,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:14,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006320230] [2025-03-17 01:41:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006320230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:14,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:14,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 01:41:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400140816] [2025-03-17 01:41:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:14,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:41:14,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:14,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:41:14,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:41:14,824 INFO L87 Difference]: Start difference. First operand 1032 states and 1497 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:16,466 INFO L93 Difference]: Finished difference Result 2446 states and 3554 transitions. [2025-03-17 01:41:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 01:41:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 238 [2025-03-17 01:41:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:16,473 INFO L225 Difference]: With dead ends: 2446 [2025-03-17 01:41:16,473 INFO L226 Difference]: Without dead ends: 1456 [2025-03-17 01:41:16,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-17 01:41:16,477 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 526 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:16,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1429 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 01:41:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-03-17 01:41:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1173. [2025-03-17 01:41:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 944 states have (on average 1.4184322033898304) internal successors, (1339), 952 states have internal predecessors, (1339), 187 states have call successors, (187), 41 states have call predecessors, (187), 41 states have return successors, (187), 179 states have call predecessors, (187), 187 states have call successors, (187) [2025-03-17 01:41:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1713 transitions. [2025-03-17 01:41:16,572 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1713 transitions. Word has length 238 [2025-03-17 01:41:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:16,574 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1713 transitions. [2025-03-17 01:41:16,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1713 transitions. [2025-03-17 01:41:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-17 01:41:16,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:16,578 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:16,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:41:16,578 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:16,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash -254739292, now seen corresponding path program 1 times [2025-03-17 01:41:16,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:16,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986452693] [2025-03-17 01:41:16,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:16,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 01:41:16,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 01:41:16,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:16,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:41:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986452693] [2025-03-17 01:41:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986452693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:17,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:17,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 01:41:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082957560] [2025-03-17 01:41:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:17,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 01:41:17,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:17,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 01:41:17,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 01:41:17,085 INFO L87 Difference]: Start difference. First operand 1173 states and 1713 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:18,408 INFO L93 Difference]: Finished difference Result 3374 states and 4923 transitions. [2025-03-17 01:41:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 01:41:18,408 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 238 [2025-03-17 01:41:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:18,416 INFO L225 Difference]: With dead ends: 3374 [2025-03-17 01:41:18,416 INFO L226 Difference]: Without dead ends: 2243 [2025-03-17 01:41:18,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:41:18,419 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 276 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:18,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1341 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 01:41:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2025-03-17 01:41:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1743. [2025-03-17 01:41:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1413 states have (on average 1.4225053078556262) internal successors, (2010), 1422 states have internal predecessors, (2010), 272 states have call successors, (272), 57 states have call predecessors, (272), 57 states have return successors, (272), 263 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-17 01:41:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2554 transitions. [2025-03-17 01:41:18,694 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2554 transitions. Word has length 238 [2025-03-17 01:41:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:18,695 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2554 transitions. [2025-03-17 01:41:18,695 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2554 transitions. [2025-03-17 01:41:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-17 01:41:18,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:18,696 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:18,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:41:18,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:18,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -521210450, now seen corresponding path program 1 times [2025-03-17 01:41:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418058166] [2025-03-17 01:41:18,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:18,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:18,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 01:41:18,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 01:41:18,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:18,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-17 01:41:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418058166] [2025-03-17 01:41:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418058166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:41:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591839456] [2025-03-17 01:41:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:18,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:41:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:18,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:41:18,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:41:18,758 INFO L87 Difference]: Start difference. First operand 1743 states and 2554 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:19,067 INFO L93 Difference]: Finished difference Result 3679 states and 5401 transitions. [2025-03-17 01:41:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:41:19,068 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 238 [2025-03-17 01:41:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:19,076 INFO L225 Difference]: With dead ends: 3679 [2025-03-17 01:41:19,076 INFO L226 Difference]: Without dead ends: 1978 [2025-03-17 01:41:19,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:41:19,081 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 32 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:19,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 355 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:41:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2025-03-17 01:41:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1794. [2025-03-17 01:41:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1464 states have (on average 1.4289617486338797) internal successors, (2092), 1473 states have internal predecessors, (2092), 272 states have call successors, (272), 57 states have call predecessors, (272), 57 states have return successors, (272), 263 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-17 01:41:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2636 transitions. [2025-03-17 01:41:19,339 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2636 transitions. Word has length 238 [2025-03-17 01:41:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:19,339 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2636 transitions. [2025-03-17 01:41:19,339 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-17 01:41:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2636 transitions. [2025-03-17 01:41:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-17 01:41:19,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:19,341 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:19,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:41:19,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:19,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash -114990902, now seen corresponding path program 1 times [2025-03-17 01:41:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793381357] [2025-03-17 01:41:19,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:19,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 01:41:19,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 01:41:19,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:19,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:41:19,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573697885] [2025-03-17 01:41:19,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:19,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:41:19,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:41:19,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:41:19,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 01:41:19,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 01:41:19,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 01:41:19,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:19,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:41:19,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:41:19,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 01:41:19,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 01:41:19,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:19,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:41:19,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:41:19,752 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:41:19,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:41:19,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 01:41:19,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 01:41:19,959 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:20,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:41:20,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:41:20 BoogieIcfgContainer [2025-03-17 01:41:20,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:41:20,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:41:20,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:41:20,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:41:20,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:40:25" (3/4) ... [2025-03-17 01:41:20,080 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:41:20,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:41:20,081 INFO L158 Benchmark]: Toolchain (without parser) took 55457.97ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 106.3MB in the beginning and 248.9MB in the end (delta: -142.6MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. [2025-03-17 01:41:20,081 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:41:20,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.52ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 90.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:41:20,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.05ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:41:20,081 INFO L158 Benchmark]: Boogie Preprocessor took 104.66ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:41:20,082 INFO L158 Benchmark]: IcfgBuilder took 552.10ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 51.8MB in the end (delta: 31.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:41:20,082 INFO L158 Benchmark]: TraceAbstraction took 54444.15ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 51.5MB in the beginning and 249.0MB in the end (delta: -197.4MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. [2025-03-17 01:41:20,082 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 444.6MB. Free memory was 249.0MB in the beginning and 248.9MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:41:20,083 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.00ms. Allocated memory is still 201.3MB. Free memory is still 114.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.52ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 90.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.05ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 104.66ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 83.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 552.10ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 51.8MB in the end (delta: 31.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54444.15ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 51.5MB in the beginning and 249.0MB in the end (delta: -197.4MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 444.6MB. Free memory was 249.0MB in the beginning and 248.9MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 75, overapproximation of shiftLeft at line 207, overapproximation of someBinaryFLOATComparisonOperation at line 194, overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 207, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 64; [L42] unsigned char var_1_25 = 2; [L43] unsigned short int var_1_26 = 32; [L44] unsigned long int var_1_27 = 100; [L45] unsigned short int var_1_28 = 64; [L46] float var_1_29 = 499.875; [L47] float var_1_30 = -0.2; [L48] float var_1_31 = 7.4; [L49] float var_1_32 = -0.375; [L50] float var_1_33 = 1.4; [L51] float var_1_34 = 200.4; [L52] float var_1_35 = 1.5; [L53] unsigned char var_1_36 = 0; [L54] unsigned char last_1_var_1_10 = 32; [L55] unsigned short int last_1_var_1_12 = 16; [L56] unsigned long int last_1_var_1_13 = 128; [L211] isInitial = 1 [L212] FCALL initially() [L213] COND TRUE 1 [L214] CALL updateLastVariables() [L202] last_1_var_1_10 = var_1_10 [L203] last_1_var_1_12 = var_1_12 [L204] last_1_var_1_13 = var_1_13 [L214] RET updateLastVariables() [L215] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] var_1_5 = __VERIFIER_nondet_long() [L147] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L147] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L150] var_1_6 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L151] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L153] var_1_7 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L154] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_9=9/5] [L157] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0, var_1_9=9/5] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L159] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L160] var_1_11 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L163] var_1_15 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L164] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L165] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L166] var_1_20 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L168] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L169] var_1_21 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L170] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L171] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L172] var_1_22 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L174] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L177] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L180] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L181] var_1_27 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L182] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L183] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L185] var_1_29 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L186] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L187] var_1_30 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L188] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L189] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L190] var_1_31 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L191] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L192] var_1_32 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L193] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L194] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L194] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L195] var_1_34 = __VERIFIER_nondet_float() [L196] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L196] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L197] var_1_36 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L198] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L199] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L215] RET updateVariables() [L216] CALL step() [L60] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L61] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L63] COND FALSE !(((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L68] var_1_33 = var_1_34 [L69] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L70] COND TRUE var_1_6 <= stepLocal_2 [L71] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L75] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L75] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L82] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L84] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L85] COND TRUE var_1_22 <= var_1_19 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L86] COND TRUE var_1_22 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27) [L87] var_1_26 = ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L100] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L101] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L102] COND FALSE !((- var_1_9) <= var_1_8) [L115] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L117] COND FALSE !((var_1_29 / var_1_30) > ((((var_1_31 / var_1_32) < 0 ) ? -(var_1_31 / var_1_32) : (var_1_31 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L122] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L123] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L123] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L124] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L131] COND TRUE var_1_20 || var_1_21 [L132] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L134] COND FALSE !(((256 - var_1_25) <= (var_1_28 + var_1_19)) || var_1_20) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L216] RET step() [L217] CALL, EXPR property() [L207] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L207] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L207] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L207-L208] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L217] RET, EXPR property() [L217] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=-4294967296, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=-4294967296, var_1_23=64, var_1_24=0, var_1_25=-256, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=255, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 228 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.3s, OverallIterations: 14, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 5876 SdHoareTripleChecker+Valid, 17.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5864 mSDsluCounter, 14289 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11450 mSDsCounter, 588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8634 IncrementalHoareTripleChecker+Invalid, 9223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 588 mSolverCounterUnsat, 2839 mSDtfsCounter, 8634 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3509 GetRequests, 3252 SyntacticMatches, 2 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1794occurred in iteration=13, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 2390 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 5192 NumberOfCodeBlocks, 5192 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6100 ConstructedInterpolants, 44 QuantifiedInterpolants, 27562 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3651 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 67680/69264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 01:41:20,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.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 e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:41:22,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:41:22,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:41:22,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:41:22,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:41:22,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:41:22,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:41:22,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:41:22,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:41:22,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:41:22,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:41:22,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:41:22,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:41:22,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:41:22,239 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:41:22,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:41:22,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:41:22,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:41:22,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:41:22,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:41:22,241 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 -> e75dd2ef07e59a4a7a70188582a14ba23653a9329506caf2137d14188791daa5 [2025-03-17 01:41:22,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:41:22,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:41:22,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:41:22,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:41:22,654 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:41:22,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2025-03-17 01:41:23,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e46b0af/4d0da72957e44c87b02342e1854e043a/FLAGc877b7d66 [2025-03-17 01:41:24,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:41:24,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2025-03-17 01:41:24,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e46b0af/4d0da72957e44c87b02342e1854e043a/FLAGc877b7d66 [2025-03-17 01:41:24,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e46b0af/4d0da72957e44c87b02342e1854e043a [2025-03-17 01:41:24,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:41:24,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:41:24,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:41:24,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:41:24,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:41:24,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd2a66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24, skipping insertion in model container [2025-03-17 01:41:24,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:41:24,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i[918,931] [2025-03-17 01:41:24,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:41:24,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:41:24,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i[918,931] [2025-03-17 01:41:24,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:41:24,374 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:41:24,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24 WrapperNode [2025-03-17 01:41:24,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:41:24,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:41:24,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:41:24,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:41:24,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,414 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2025-03-17 01:41:24,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:41:24,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:41:24,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:41:24,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:41:24,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:41:24,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:41:24,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:41:24,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:41:24,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:41:24,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (1/1) ... [2025-03-17 01:41:24,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:41:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:41:24,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:41:24,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:41:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:41:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:41:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:41:24,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:41:24,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:41:24,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:41:24,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:41:24,600 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:41:31,951 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 01:41:31,951 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:41:31,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:41:31,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:41:31,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:41:31 BoogieIcfgContainer [2025-03-17 01:41:31,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:41:31,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:41:31,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:41:31,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:41:31,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:41:24" (1/3) ... [2025-03-17 01:41:31,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d08ddc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:41:31, skipping insertion in model container [2025-03-17 01:41:31,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:41:24" (2/3) ... [2025-03-17 01:41:31,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d08ddc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:41:31, skipping insertion in model container [2025-03-17 01:41:31,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:41:31" (3/3) ... [2025-03-17 01:41:31,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i [2025-03-17 01:41:31,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:41:31,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-9.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:41:32,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:41:32,052 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;@6600fbf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:41:32,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:41:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 01:41:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 01:41:32,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:32,070 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:32,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2050948042, now seen corresponding path program 1 times [2025-03-17 01:41:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:41:32,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48702579] [2025-03-17 01:41:32,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:32,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:41:32,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:41:32,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:41:32,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 01:41:32,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 01:41:32,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 01:41:32,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:32,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:41:32,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:41:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1172 proven. 0 refuted. 0 times theorem prover too weak. 1492 trivial. 0 not checked. [2025-03-17 01:41:32,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:41:32,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:41:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48702579] [2025-03-17 01:41:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48702579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:32,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:32,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:41:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946288646] [2025-03-17 01:41:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:32,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:41:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:41:32,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:41:32,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:41:32,781 INFO L87 Difference]: Start difference. First operand has 96 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-17 01:41:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:32,802 INFO L93 Difference]: Finished difference Result 189 states and 347 transitions. [2025-03-17 01:41:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:41:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 225 [2025-03-17 01:41:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:32,813 INFO L225 Difference]: With dead ends: 189 [2025-03-17 01:41:32,814 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 01:41:32,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:41:32,820 INFO L435 NwaCegarLoop]: 151 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, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:32,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:41:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 01:41:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 01:41:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 01:41:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 151 transitions. [2025-03-17 01:41:32,864 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 151 transitions. Word has length 225 [2025-03-17 01:41:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:32,864 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 151 transitions. [2025-03-17 01:41:32,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-17 01:41:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 151 transitions. [2025-03-17 01:41:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-17 01:41:32,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:32,870 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:32,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 01:41:33,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:41:33,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1670792336, now seen corresponding path program 1 times [2025-03-17 01:41:33,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:41:33,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492887354] [2025-03-17 01:41:33,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:33,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:41:33,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:41:33,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 01:41:33,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 01:41:33,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 01:41:33,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 01:41:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:33,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:33,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 01:41:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates...