./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.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 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:55:51,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:55:51,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:55:51,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:55:51,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:55:51,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:55:51,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:55:51,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:55:51,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:55:51,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:55:51,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:55:51,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:55:51,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:55:51,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:55:51,944 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:55:51,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:55:51,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:55:51,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:55:51,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:55:51,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:55:51,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:55:51,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:55:51,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:55:51,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:55:51,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:55:51,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:55:51,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:55:51,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:55:51,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:55:51,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:55:51,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:55:51,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:55:51,947 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 -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2025-03-08 12:55:52,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:55:52,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:55:52,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:55:52,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:55:52,202 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:55:52,203 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-ps-ci_file-84.i [2025-03-08 12:55:53,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8492b3b88/de846ae728a6454e9a2d1a5e7750e19a/FLAG44ee56e2e [2025-03-08 12:55:53,601 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:55:53,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-08 12:55:53,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8492b3b88/de846ae728a6454e9a2d1a5e7750e19a/FLAG44ee56e2e [2025-03-08 12:55:53,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8492b3b88/de846ae728a6454e9a2d1a5e7750e19a [2025-03-08 12:55:53,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:55:53,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:55:53,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:55:53,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:55:53,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:55:53,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:55:53" (1/1) ... [2025-03-08 12:55:53,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689a107c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:53, skipping insertion in model container [2025-03-08 12:55:53,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:55:53" (1/1) ... [2025-03-08 12:55:53,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:55:54,034 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-ps-ci_file-84.i[919,932] [2025-03-08 12:55:54,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:55:54,087 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:55:54,094 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-ps-ci_file-84.i[919,932] [2025-03-08 12:55:54,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:55:54,146 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:55:54,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54 WrapperNode [2025-03-08 12:55:54,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:55:54,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:55:54,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:55:54,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:55:54,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,186 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-08 12:55:54,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:55:54,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:55:54,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:55:54,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:55:54,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,223 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:55:54,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:55:54,259 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:55:54,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:55:54,260 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:55:54,261 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (1/1) ... [2025-03-08 12:55:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:55:54,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:55:54,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:55:54,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:55:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:55:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:55:54,312 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:55:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:55:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:55:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:55:54,379 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:55:54,381 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:55:54,823 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-08 12:55:54,857 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 12:55:54,858 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:55:54,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:55:54,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:55:54,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:55:54 BoogieIcfgContainer [2025-03-08 12:55:54,883 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:55:54,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:55:54,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:55:54,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:55:54,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:55:53" (1/3) ... [2025-03-08 12:55:54,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b32b9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:55:54, skipping insertion in model container [2025-03-08 12:55:54,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:54" (2/3) ... [2025-03-08 12:55:54,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b32b9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:55:54, skipping insertion in model container [2025-03-08 12:55:54,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:55:54" (3/3) ... [2025-03-08 12:55:54,891 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-08 12:55:54,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:55:54,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:55:54,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:55:54,956 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;@9f9ef4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:55:54,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:55:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:55:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 12:55:54,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:55:54,979 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:55:54,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:55:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:55:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1177238325, now seen corresponding path program 1 times [2025-03-08 12:55:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:55:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736012695] [2025-03-08 12:55:54,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:55:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:55:55,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:55:55,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:55:55,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:55:55,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:55:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 12:55:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:55:55,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736012695] [2025-03-08 12:55:55,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736012695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:55:55,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527749835] [2025-03-08 12:55:55,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:55:55,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:55:55,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:55:55,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:55:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:55:55,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:55:55,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:55:55,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:55:55,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:55:55,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:55:55,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:55:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 12:55:55,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:55:55,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527749835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:55:55,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:55:55,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:55:55,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148396825] [2025-03-08 12:55:55,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:55:55,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:55:55,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:55:55,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:55:55,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:55:55,538 INFO L87 Difference]: Start difference. First operand has 109 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:55:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:55:55,572 INFO L93 Difference]: Finished difference Result 212 states and 371 transitions. [2025-03-08 12:55:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:55:55,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2025-03-08 12:55:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:55:55,579 INFO L225 Difference]: With dead ends: 212 [2025-03-08 12:55:55,579 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 12:55:55,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:55:55,583 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:55:55,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:55:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 12:55:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-08 12:55:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:55:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2025-03-08 12:55:55,618 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 209 [2025-03-08 12:55:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:55:55,618 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2025-03-08 12:55:55,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 12:55:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2025-03-08 12:55:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 12:55:55,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:55:55,621 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:55:55,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:55:55,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:55:55,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:55:55,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:55:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash -126249261, now seen corresponding path program 1 times [2025-03-08 12:55:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:55:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30659457] [2025-03-08 12:55:55,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:55:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:55:55,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:55:55,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:55:55,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:55:55,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:55:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:55:56,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:55:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30659457] [2025-03-08 12:55:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30659457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:55:56,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:55:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:55:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176034002] [2025-03-08 12:55:56,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:55:56,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:55:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:55:56,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:55:56,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:55:56,051 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:55:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:55:56,101 INFO L93 Difference]: Finished difference Result 206 states and 325 transitions. [2025-03-08 12:55:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:55:56,104 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2025-03-08 12:55:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:55:56,105 INFO L225 Difference]: With dead ends: 206 [2025-03-08 12:55:56,105 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 12:55:56,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:55:56,106 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:55:56,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 147 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:55:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 12:55:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 12:55:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:55:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-03-08 12:55:56,129 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 209 [2025-03-08 12:55:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:55:56,130 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-03-08 12:55:56,130 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:55:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-03-08 12:55:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 12:55:56,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:55:56,133 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:55:56,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:55:56,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:55:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:55:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2143066550, now seen corresponding path program 1 times [2025-03-08 12:55:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:55:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624528705] [2025-03-08 12:55:56,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:55:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:55:56,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 12:55:56,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 12:55:56,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:55:56,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:55:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:55:58,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:55:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624528705] [2025-03-08 12:55:58,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624528705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:55:58,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:55:58,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:55:58,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270373985] [2025-03-08 12:55:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:55:58,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:55:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:55:58,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:55:58,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:55:58,790 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:00,072 INFO L93 Difference]: Finished difference Result 238 states and 357 transitions. [2025-03-08 12:56:00,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:56:00,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2025-03-08 12:56:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:00,074 INFO L225 Difference]: With dead ends: 238 [2025-03-08 12:56:00,074 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 12:56:00,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:56:00,075 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 41 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:00,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 634 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:56:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 12:56:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-08 12:56:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 97 states have internal predecessors, (128), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:56:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2025-03-08 12:56:00,088 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 210 [2025-03-08 12:56:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2025-03-08 12:56:00,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2025-03-08 12:56:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:56:00,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:00,094 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:00,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:56:00,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:00,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1840123910, now seen corresponding path program 1 times [2025-03-08 12:56:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590767264] [2025-03-08 12:56:00,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:00,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:56:00,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:56:00,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:00,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590767264] [2025-03-08 12:56:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590767264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:56:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117889754] [2025-03-08 12:56:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:56:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:56:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:56:02,571 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:03,782 INFO L93 Difference]: Finished difference Result 299 states and 438 transitions. [2025-03-08 12:56:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:56:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2025-03-08 12:56:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:03,788 INFO L225 Difference]: With dead ends: 299 [2025-03-08 12:56:03,788 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 12:56:03,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:56:03,792 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 34 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:03,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 822 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:56:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 12:56:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-03-08 12:56:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 124 states have internal predecessors, (162), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 12:56:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2025-03-08 12:56:03,814 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 211 [2025-03-08 12:56:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:03,814 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2025-03-08 12:56:03,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2025-03-08 12:56:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:56:03,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:03,816 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:03,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:56:03,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:03,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1334565285, now seen corresponding path program 1 times [2025-03-08 12:56:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575236937] [2025-03-08 12:56:03,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:03,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:56:03,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:56:03,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:03,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:05,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575236937] [2025-03-08 12:56:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575236937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:56:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505350211] [2025-03-08 12:56:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:05,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:56:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:05,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:56:05,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:56:05,913 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:06,730 INFO L93 Difference]: Finished difference Result 332 states and 478 transitions. [2025-03-08 12:56:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:56:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2025-03-08 12:56:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:06,732 INFO L225 Difference]: With dead ends: 332 [2025-03-08 12:56:06,732 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 12:56:06,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:56:06,733 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 60 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:06,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 727 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:56:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 12:56:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 139. [2025-03-08 12:56:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 100 states have internal predecessors, (130), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:56:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-03-08 12:56:06,757 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 211 [2025-03-08 12:56:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-03-08 12:56:06,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-03-08 12:56:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:56:06,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:06,762 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:06,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:56:06,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:06,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:06,762 INFO L85 PathProgramCache]: Analyzing trace with hash 873021256, now seen corresponding path program 1 times [2025-03-08 12:56:06,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:06,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652269616] [2025-03-08 12:56:06,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:06,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:56:06,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:56:06,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:06,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652269616] [2025-03-08 12:56:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652269616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 12:56:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458289818] [2025-03-08 12:56:08,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:08,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:56:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:08,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:56:08,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:56:08,699 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:09,348 INFO L93 Difference]: Finished difference Result 412 states and 585 transitions. [2025-03-08 12:56:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:56:09,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-08 12:56:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:09,351 INFO L225 Difference]: With dead ends: 412 [2025-03-08 12:56:09,351 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 12:56:09,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:56:09,352 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 99 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:09,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 827 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:56:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 12:56:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 170. [2025-03-08 12:56:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:56:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-08 12:56:09,364 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 212 [2025-03-08 12:56:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:09,365 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-08 12:56:09,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-08 12:56:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:56:09,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:09,366 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:09,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:56:09,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash -923930103, now seen corresponding path program 1 times [2025-03-08 12:56:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021051320] [2025-03-08 12:56:09,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:09,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:56:09,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:56:09,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:09,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021051320] [2025-03-08 12:56:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021051320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:11,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 12:56:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479789929] [2025-03-08 12:56:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:11,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:56:11,519 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:12,318 INFO L93 Difference]: Finished difference Result 419 states and 595 transitions. [2025-03-08 12:56:12,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:56:12,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-08 12:56:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:12,321 INFO L225 Difference]: With dead ends: 419 [2025-03-08 12:56:12,322 INFO L226 Difference]: Without dead ends: 252 [2025-03-08 12:56:12,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:56:12,324 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 100 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:12,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 919 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:56:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-08 12:56:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 170. [2025-03-08 12:56:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:56:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-08 12:56:12,339 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 212 [2025-03-08 12:56:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:12,339 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-08 12:56:12,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-08 12:56:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:56:12,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:12,341 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:12,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:56:12,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:12,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash 579618249, now seen corresponding path program 1 times [2025-03-08 12:56:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:12,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189586234] [2025-03-08 12:56:12,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:12,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:56:12,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:56:12,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:14,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:14,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189586234] [2025-03-08 12:56:14,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189586234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:14,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:14,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 12:56:14,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722777802] [2025-03-08 12:56:14,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:14,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:14,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:14,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:14,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:56:14,842 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:16,320 INFO L93 Difference]: Finished difference Result 450 states and 635 transitions. [2025-03-08 12:56:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:56:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-08 12:56:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:16,323 INFO L225 Difference]: With dead ends: 450 [2025-03-08 12:56:16,323 INFO L226 Difference]: Without dead ends: 283 [2025-03-08 12:56:16,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:56:16,325 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 110 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:16,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1013 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 12:56:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-08 12:56:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 174. [2025-03-08 12:56:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 134 states have (on average 1.335820895522388) internal successors, (179), 135 states have internal predecessors, (179), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:56:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 251 transitions. [2025-03-08 12:56:16,336 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 251 transitions. Word has length 212 [2025-03-08 12:56:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:16,337 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 251 transitions. [2025-03-08 12:56:16,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2025-03-08 12:56:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:56:16,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:16,338 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:16,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:56:16,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:16,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1217333110, now seen corresponding path program 1 times [2025-03-08 12:56:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:16,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184262105] [2025-03-08 12:56:16,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:16,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:56:16,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:56:16,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:16,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184262105] [2025-03-08 12:56:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184262105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:17,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 12:56:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799712747] [2025-03-08 12:56:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:17,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:17,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:17,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:17,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:56:17,626 INFO L87 Difference]: Start difference. First operand 174 states and 251 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:18,258 INFO L93 Difference]: Finished difference Result 429 states and 607 transitions. [2025-03-08 12:56:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:56:18,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2025-03-08 12:56:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:18,260 INFO L225 Difference]: With dead ends: 429 [2025-03-08 12:56:18,260 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 12:56:18,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:56:18,261 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 135 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:18,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 664 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:56:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 12:56:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 170. [2025-03-08 12:56:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 12:56:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-08 12:56:18,271 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 212 [2025-03-08 12:56:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:18,272 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-08 12:56:18,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-08 12:56:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 12:56:18,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:18,273 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:56:18,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash -261730129, now seen corresponding path program 1 times [2025-03-08 12:56:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896064037] [2025-03-08 12:56:18,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:18,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:56:18,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:56:18,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:18,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896064037] [2025-03-08 12:56:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896064037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:56:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101392201] [2025-03-08 12:56:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:56:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:18,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:56:18,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:56:18,335 INFO L87 Difference]: Start difference. First operand 170 states and 245 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:18,409 INFO L93 Difference]: Finished difference Result 404 states and 575 transitions. [2025-03-08 12:56:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:56:18,410 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-08 12:56:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:18,412 INFO L225 Difference]: With dead ends: 404 [2025-03-08 12:56:18,412 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 12:56:18,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:56:18,413 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 45 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:18,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 277 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:56:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 12:56:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 214. [2025-03-08 12:56:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 173 states have internal predecessors, (228), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 12:56:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 304 transitions. [2025-03-08 12:56:18,425 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 304 transitions. Word has length 213 [2025-03-08 12:56:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:18,425 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 304 transitions. [2025-03-08 12:56:18,425 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 304 transitions. [2025-03-08 12:56:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 12:56:18,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:18,427 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:18,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:56:18,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:18,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1005436406, now seen corresponding path program 1 times [2025-03-08 12:56:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565124414] [2025-03-08 12:56:18,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:18,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:56:18,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:56:18,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:18,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565124414] [2025-03-08 12:56:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565124414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:18,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:56:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833828834] [2025-03-08 12:56:18,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:18,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:56:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:18,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:56:18,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:56:18,564 INFO L87 Difference]: Start difference. First operand 214 states and 304 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:18,721 INFO L93 Difference]: Finished difference Result 596 states and 848 transitions. [2025-03-08 12:56:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:56:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-08 12:56:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:18,723 INFO L225 Difference]: With dead ends: 596 [2025-03-08 12:56:18,723 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 12:56:18,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:56:18,724 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 117 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:18,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 510 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:56:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 12:56:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 288. [2025-03-08 12:56:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 210 states have (on average 1.3047619047619048) internal successors, (274), 212 states have internal predecessors, (274), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 12:56:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 414 transitions. [2025-03-08 12:56:18,746 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 414 transitions. Word has length 213 [2025-03-08 12:56:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:18,747 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 414 transitions. [2025-03-08 12:56:18,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 414 transitions. [2025-03-08 12:56:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 12:56:18,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:18,748 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:18,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:56:18,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 961706664, now seen corresponding path program 1 times [2025-03-08 12:56:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088509082] [2025-03-08 12:56:18,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:18,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:56:18,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:56:18,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:18,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:18,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088509082] [2025-03-08 12:56:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088509082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:18,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:56:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504991050] [2025-03-08 12:56:18,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:56:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:18,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:56:18,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:56:18,817 INFO L87 Difference]: Start difference. First operand 288 states and 414 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:18,893 INFO L93 Difference]: Finished difference Result 526 states and 745 transitions. [2025-03-08 12:56:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:56:18,894 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2025-03-08 12:56:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:18,896 INFO L225 Difference]: With dead ends: 526 [2025-03-08 12:56:18,896 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 12:56:18,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:56:18,897 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 39 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:18,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 262 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:56:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 12:56:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 273. [2025-03-08 12:56:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 197 states have (on average 1.284263959390863) internal successors, (253), 198 states have internal predecessors, (253), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 389 transitions. [2025-03-08 12:56:18,916 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 389 transitions. Word has length 213 [2025-03-08 12:56:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:18,916 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 389 transitions. [2025-03-08 12:56:18,916 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, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 389 transitions. [2025-03-08 12:56:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:18,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:18,917 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:18,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:56:18,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:18,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash 144152097, now seen corresponding path program 1 times [2025-03-08 12:56:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:18,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543841806] [2025-03-08 12:56:18,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:18,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:18,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:18,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:18,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:20,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543841806] [2025-03-08 12:56:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543841806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:20,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:20,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 12:56:20,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117155066] [2025-03-08 12:56:20,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:20,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:56:20,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:20,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:56:20,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:56:20,248 INFO L87 Difference]: Start difference. First operand 273 states and 389 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:21,165 INFO L93 Difference]: Finished difference Result 606 states and 843 transitions. [2025-03-08 12:56:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:56:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-08 12:56:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:21,168 INFO L225 Difference]: With dead ends: 606 [2025-03-08 12:56:21,168 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 12:56:21,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:56:21,170 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 93 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:21,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 890 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:56:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 12:56:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 300. [2025-03-08 12:56:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 225 states have internal predecessors, (292), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-08 12:56:21,194 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 214 [2025-03-08 12:56:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:21,194 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-08 12:56:21,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-08 12:56:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:21,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:21,196 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:21,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 12:56:21,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:21,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash 273234816, now seen corresponding path program 1 times [2025-03-08 12:56:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361249127] [2025-03-08 12:56:21,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:21,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:21,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:21,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:21,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:23,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:23,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361249127] [2025-03-08 12:56:23,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361249127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:23,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 12:56:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525077908] [2025-03-08 12:56:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:23,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:23,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:56:23,142 INFO L87 Difference]: Start difference. First operand 300 states and 428 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:24,348 INFO L93 Difference]: Finished difference Result 611 states and 853 transitions. [2025-03-08 12:56:24,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:56:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-08 12:56:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:24,350 INFO L225 Difference]: With dead ends: 611 [2025-03-08 12:56:24,350 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 12:56:24,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:56:24,351 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 118 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:24,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1150 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:56:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 12:56:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 300. [2025-03-08 12:56:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 225 states have internal predecessors, (292), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-08 12:56:24,371 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 214 [2025-03-08 12:56:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:24,372 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-08 12:56:24,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-08 12:56:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:24,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:24,373 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 12:56:24,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:24,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash -361406528, now seen corresponding path program 1 times [2025-03-08 12:56:24,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:24,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797498741] [2025-03-08 12:56:24,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:24,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:24,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:24,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:24,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797498741] [2025-03-08 12:56:25,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797498741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:25,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:25,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 12:56:25,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298324963] [2025-03-08 12:56:25,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:25,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:25,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:25,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:56:25,436 INFO L87 Difference]: Start difference. First operand 300 states and 428 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:26,218 INFO L93 Difference]: Finished difference Result 639 states and 888 transitions. [2025-03-08 12:56:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:56:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-08 12:56:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:26,221 INFO L225 Difference]: With dead ends: 639 [2025-03-08 12:56:26,221 INFO L226 Difference]: Without dead ends: 416 [2025-03-08 12:56:26,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:56:26,222 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 104 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:26,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 923 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:56:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-08 12:56:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 304. [2025-03-08 12:56:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 228 states have (on average 1.3070175438596492) internal successors, (298), 229 states have internal predecessors, (298), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 434 transitions. [2025-03-08 12:56:26,241 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 434 transitions. Word has length 214 [2025-03-08 12:56:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:26,241 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 434 transitions. [2025-03-08 12:56:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 434 transitions. [2025-03-08 12:56:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:26,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:26,243 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:26,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 12:56:26,243 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:26,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -232323809, now seen corresponding path program 1 times [2025-03-08 12:56:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263413395] [2025-03-08 12:56:26,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:26,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:26,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:26,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:26,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:26,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:28,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263413395] [2025-03-08 12:56:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263413395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 12:56:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064062170] [2025-03-08 12:56:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:28,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:28,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:28,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:28,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:56:28,424 INFO L87 Difference]: Start difference. First operand 304 states and 434 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:29,540 INFO L93 Difference]: Finished difference Result 607 states and 849 transitions. [2025-03-08 12:56:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:56:29,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2025-03-08 12:56:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:29,543 INFO L225 Difference]: With dead ends: 607 [2025-03-08 12:56:29,543 INFO L226 Difference]: Without dead ends: 380 [2025-03-08 12:56:29,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:56:29,544 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 116 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:29,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1027 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:56:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-08 12:56:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 300. [2025-03-08 12:56:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 225 states have internal predecessors, (292), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-08 12:56:29,562 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 214 [2025-03-08 12:56:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:29,562 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-08 12:56:29,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-08 12:56:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:29,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:29,564 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:29,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 12:56:29,564 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:29,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 628405062, now seen corresponding path program 1 times [2025-03-08 12:56:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525187506] [2025-03-08 12:56:29,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:29,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:29,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:29,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:29,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 102 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-08 12:56:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525187506] [2025-03-08 12:56:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525187506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:56:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918867945] [2025-03-08 12:56:30,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:30,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:56:30,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:56:30,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:56:30,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:56:30,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:30,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:30,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:30,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:30,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 12:56:30,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:56:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1120 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-08 12:56:31,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:56:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918867945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:56:33,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:56:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2025-03-08 12:56:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838343017] [2025-03-08 12:56:33,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:56:33,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 12:56:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:33,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 12:56:33,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-08 12:56:33,134 INFO L87 Difference]: Start difference. First operand 300 states and 428 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-08 12:56:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:33,504 INFO L93 Difference]: Finished difference Result 559 states and 791 transitions. [2025-03-08 12:56:33,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:56:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) Word has length 214 [2025-03-08 12:56:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:33,507 INFO L225 Difference]: With dead ends: 559 [2025-03-08 12:56:33,507 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 12:56:33,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-03-08 12:56:33,508 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 45 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:33,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 559 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:56:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 12:56:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 308. [2025-03-08 12:56:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 230 states have (on average 1.291304347826087) internal successors, (297), 231 states have internal predecessors, (297), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 433 transitions. [2025-03-08 12:56:33,531 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 433 transitions. Word has length 214 [2025-03-08 12:56:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:33,531 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 433 transitions. [2025-03-08 12:56:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 6 states have call successors, (64), 4 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-08 12:56:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 433 transitions. [2025-03-08 12:56:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:33,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:33,533 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:33,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 12:56:33,737 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,SelfDestructingSolverStorable16 [2025-03-08 12:56:33,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1448804281, now seen corresponding path program 1 times [2025-03-08 12:56:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841251429] [2025-03-08 12:56:33,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:33,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:33,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:33,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:33,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:33,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:56:33,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229867519] [2025-03-08 12:56:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:33,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:56:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:56:33,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:56:33,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:56:33,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:33,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:33,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:33,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:33,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 12:56:33,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:56:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-08 12:56:34,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:56:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 12:56:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:34,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841251429] [2025-03-08 12:56:34,450 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 12:56:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229867519] [2025-03-08 12:56:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229867519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:56:34,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:56:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-08 12:56:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396646949] [2025-03-08 12:56:34,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:56:34,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 12:56:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:34,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 12:56:34,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:56:34,451 INFO L87 Difference]: Start difference. First operand 308 states and 433 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 12:56:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:37,703 INFO L93 Difference]: Finished difference Result 1395 states and 1869 transitions. [2025-03-08 12:56:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 12:56:37,704 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 214 [2025-03-08 12:56:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:37,708 INFO L225 Difference]: With dead ends: 1395 [2025-03-08 12:56:37,708 INFO L226 Difference]: Without dead ends: 1172 [2025-03-08 12:56:37,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=370, Invalid=1036, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 12:56:37,709 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 736 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:37,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 734 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 12:56:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-08 12:56:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 532. [2025-03-08 12:56:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 452 states have (on average 1.3075221238938053) internal successors, (591), 453 states have internal predecessors, (591), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 727 transitions. [2025-03-08 12:56:37,743 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 727 transitions. Word has length 214 [2025-03-08 12:56:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 727 transitions. [2025-03-08 12:56:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 12:56:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2025-03-08 12:56:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:37,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:37,745 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:37,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:56:37,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 12:56:37,946 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:37,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash 219687208, now seen corresponding path program 1 times [2025-03-08 12:56:37,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:37,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885876683] [2025-03-08 12:56:37,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:37,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:37,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:37,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:37,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:56:37,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822426889] [2025-03-08 12:56:37,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:37,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:56:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:56:37,995 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-08 12:56:37,996 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-08 12:56:38,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:38,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:38,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:38,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:38,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 12:56:38,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:56:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1119 proven. 189 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-08 12:56:38,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:56:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:56:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885876683] [2025-03-08 12:56:39,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 12:56:39,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822426889] [2025-03-08 12:56:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822426889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:56:39,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:56:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-08 12:56:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355891823] [2025-03-08 12:56:39,048 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 12:56:39,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:39,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:56:39,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:39,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:56:39,048 INFO L87 Difference]: Start difference. First operand 532 states and 727 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 12:56:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:39,329 INFO L93 Difference]: Finished difference Result 902 states and 1217 transitions. [2025-03-08 12:56:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 12:56:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 214 [2025-03-08 12:56:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:39,332 INFO L225 Difference]: With dead ends: 902 [2025-03-08 12:56:39,332 INFO L226 Difference]: Without dead ends: 454 [2025-03-08 12:56:39,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:56:39,333 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:39,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:56:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-08 12:56:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 448. [2025-03-08 12:56:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 361 states have (on average 1.2742382271468145) internal successors, (460), 362 states have internal predecessors, (460), 68 states have call successors, (68), 18 states have call predecessors, (68), 18 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:56:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 596 transitions. [2025-03-08 12:56:39,360 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 596 transitions. Word has length 214 [2025-03-08 12:56:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:39,361 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 596 transitions. [2025-03-08 12:56:39,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (32), 4 states have call predecessors, (32), 7 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 12:56:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 596 transitions. [2025-03-08 12:56:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 12:56:39,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:39,362 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:39,369 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-08 12:56:39,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:56:39,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:39,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1437488154, now seen corresponding path program 1 times [2025-03-08 12:56:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:56:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100756970] [2025-03-08 12:56:39,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:56:39,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:39,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:39,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:39,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:56:39,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62270009] [2025-03-08 12:56:39,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:56:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:56:39,615 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-08 12:56:39,616 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-08 12:56:39,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:39,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:39,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:39,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:56:39,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:56:39,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 12:56:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 12:56:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:56:40,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:56:40,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:56:40,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:56:40,023 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-08 12:56:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:56:40,217 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:40,323 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:56:40,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:56:40 BoogieIcfgContainer [2025-03-08 12:56:40,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:56:40,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:56:40,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:56:40,328 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:56:40,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:55:54" (3/4) ... [2025-03-08 12:56:40,330 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:56:40,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:56:40,331 INFO L158 Benchmark]: Toolchain (without parser) took 46405.55ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 109.7MB in the beginning and 87.5MB in the end (delta: 22.2MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-03-08 12:56:40,332 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:56:40,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.96ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 93.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:56:40,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.37ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.6MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:56:40,333 INFO L158 Benchmark]: Boogie Preprocessor took 68.11ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 82.5MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:56:40,333 INFO L158 Benchmark]: IcfgBuilder took 623.70ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 48.1MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:56:40,334 INFO L158 Benchmark]: TraceAbstraction took 45442.55ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 47.5MB in the beginning and 87.7MB in the end (delta: -40.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:56:40,334 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 87.5MB in the end (delta: 207.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:56:40,335 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.96ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 93.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.37ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.6MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.11ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 82.5MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 623.70ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 48.1MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45442.55ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 47.5MB in the beginning and 87.7MB in the end (delta: -40.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 87.5MB in the end (delta: 207.8kB). 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 someUnaryDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of someBinaryDOUBLEComparisonOperation at line 167. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] signed short int var_1_35 = 8; [L50] signed short int var_1_37 = -4; [L51] float var_1_38 = 15.875; [L52] double var_1_39 = 0.125; [L53] double var_1_40 = 3.8; [L54] signed char var_1_43 = -8; [L55] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L186] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L137] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] var_1_7 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L146] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L147] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L148] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L148] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-4, var_1_9=50] [L149] var_1_8 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L150] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L151] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L151] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L152] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L153] var_1_10 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L154] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L155] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L157] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L158] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L159] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L160] var_1_16 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L161] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L162] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L163] var_1_17 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L164] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L165] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L165] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L166] var_1_21 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L167] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L170] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L173] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L176] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L180] var_1_39 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L181] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L182] var_1_40 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L197] RET updateVariables() [L198] CALL step() [L59] var_1_22 = var_1_10 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L60] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L65] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L76] COND TRUE var_1_10 != ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) [L77] var_1_33 = (5 + var_1_11) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L79] COND FALSE !((~ var_1_4) > (var_1_4 / var_1_11)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L82] var_1_37 = ((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) < (var_1_4)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L83] COND TRUE var_1_7 == var_1_11 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L84] COND TRUE (var_1_39 - var_1_40) < var_1_21 [L85] var_1_38 = ((((((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) < 0 ) ? -(((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) : ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L92] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L93] COND FALSE !(((var_1_11 + -128) % var_1_10) >= var_1_15) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L99] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=50] [L99] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L104] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L106] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L106] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L107] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L108] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L112] signed long int stepLocal_1 = -4; [L113] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L114] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L119] var_1_18 = var_1_17 [L120] var_1_19 = 0 [L121] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L125] COND TRUE var_1_3 <= var_1_1 [L126] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L130] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L131] COND TRUE (~ var_1_3) < stepLocal_2 [L132] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L189-L190] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=129, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=129, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=131, var_1_35=8, var_1_37=0, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=-1, var_1_6=50, var_1_7=126, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 204 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.3s, OverallIterations: 20, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2244 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2212 mSDsluCounter, 12436 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9635 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7083 IncrementalHoareTripleChecker+Invalid, 7302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 2801 mSDtfsCounter, 7083 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1540 GetRequests, 1336 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=18, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1647 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 5314 NumberOfCodeBlocks, 5314 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4650 ConstructedInterpolants, 0 QuantifiedInterpolants, 21581 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 43091/43648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:56:40,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.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 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:56:42,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:56:42,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:56:42,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:56:42,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:56:42,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:56:42,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:56:42,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:56:42,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:56:42,123 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:56:42,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:56:42,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:56:42,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:56:42,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:56:42,123 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:56:42,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:56:42,124 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:56:42,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:56:42,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:56:42,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:56:42,126 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:56:42,126 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:56:42,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:56:42,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:56:42,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:56:42,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:56:42,126 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 -> 6871ab96a9f52a49c873d6506e9b30443151052bffac3c098c041f36f26e7383 [2025-03-08 12:56:42,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:56:42,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:56:42,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:56:42,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:56:42,348 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:56:42,349 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-ps-ci_file-84.i [2025-03-08 12:56:43,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a127d0f09/42fc4da70a2a42ebbf182921d172400f/FLAGe9be9c6f9 [2025-03-08 12:56:43,701 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:56:43,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-08 12:56:43,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a127d0f09/42fc4da70a2a42ebbf182921d172400f/FLAGe9be9c6f9 [2025-03-08 12:56:43,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a127d0f09/42fc4da70a2a42ebbf182921d172400f [2025-03-08 12:56:43,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:56:43,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:56:43,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:56:43,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:56:43,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:56:43,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:56:43" (1/1) ... [2025-03-08 12:56:43,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d621b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:43, skipping insertion in model container [2025-03-08 12:56:43,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:56:43" (1/1) ... [2025-03-08 12:56:43,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:56:43,858 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-ps-ci_file-84.i[919,932] [2025-03-08 12:56:43,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:56:43,947 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:56:43,957 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-ps-ci_file-84.i[919,932] [2025-03-08 12:56:44,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:56:44,020 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:56:44,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44 WrapperNode [2025-03-08 12:56:44,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:56:44,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:56:44,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:56:44,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:56:44,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,073 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-03-08 12:56:44,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:56:44,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:56:44,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:56:44,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:56:44,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,109 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:56:44,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:56:44,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:56:44,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:56:44,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:56:44,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (1/1) ... [2025-03-08 12:56:44,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:56:44,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:56:44,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:56:44,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:56:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:56:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:56:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:56:44,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:56:44,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:56:44,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:56:44,253 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:56:44,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:56:45,424 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 12:56:45,424 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:56:45,434 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:56:45,434 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:56:45,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:56:45 BoogieIcfgContainer [2025-03-08 12:56:45,435 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:56:45,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:56:45,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:56:45,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:56:45,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:56:43" (1/3) ... [2025-03-08 12:56:45,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c49ea26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:56:45, skipping insertion in model container [2025-03-08 12:56:45,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:56:44" (2/3) ... [2025-03-08 12:56:45,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c49ea26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:56:45, skipping insertion in model container [2025-03-08 12:56:45,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:56:45" (3/3) ... [2025-03-08 12:56:45,441 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i [2025-03-08 12:56:45,452 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:56:45,453 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-84.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:56:45,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:56:45,503 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;@48a4ee44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:56:45,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:56:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:56:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:56:45,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:45,521 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:45,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:45,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1909294699, now seen corresponding path program 1 times [2025-03-08 12:56:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:56:45,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983524300] [2025-03-08 12:56:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:45,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:56:45,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:56:45,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:56:45,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:56:45,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:56:45,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:56:45,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:45,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:45,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:56:45,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:56:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1068 proven. 135 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2025-03-08 12:56:46,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:56:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 12:56:47,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:56:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983524300] [2025-03-08 12:56:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983524300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:56:47,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:56:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2025-03-08 12:56:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577292425] [2025-03-08 12:56:47,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:56:47,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 12:56:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:56:47,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 12:56:47,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:56:47,595 INFO L87 Difference]: Start difference. First operand has 91 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 57 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2025-03-08 12:56:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:48,342 INFO L93 Difference]: Finished difference Result 188 states and 329 transitions. [2025-03-08 12:56:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 12:56:48,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 203 [2025-03-08 12:56:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:48,358 INFO L225 Difference]: With dead ends: 188 [2025-03-08 12:56:48,358 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 12:56:48,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2025-03-08 12:56:48,363 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 106 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:48,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 235 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:56:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 12:56:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-08 12:56:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:56:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2025-03-08 12:56:48,407 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 203 [2025-03-08 12:56:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:48,407 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2025-03-08 12:56:48,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 4 states have call successors, (61), 3 states have call predecessors, (61), 6 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2025-03-08 12:56:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2025-03-08 12:56:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 12:56:48,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:48,413 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:48,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 12:56:48,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:56:48,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:48,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1541200726, now seen corresponding path program 1 times [2025-03-08 12:56:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:56:48,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773438494] [2025-03-08 12:56:48,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:48,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:56:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:56:48,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:56:48,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:56:48,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 12:56:48,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 12:56:48,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:48,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:48,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:56:48,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:56:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 12:56:49,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:56:49,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:56:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773438494] [2025-03-08 12:56:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773438494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:56:49,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:56:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:56:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377723521] [2025-03-08 12:56:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:56:49,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:56:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:56:49,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:56:49,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:56:49,220 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:49,287 INFO L93 Difference]: Finished difference Result 186 states and 279 transitions. [2025-03-08 12:56:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:56:49,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-08 12:56:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:49,298 INFO L225 Difference]: With dead ends: 186 [2025-03-08 12:56:49,298 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 12:56:49,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:56:49,301 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:49,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 123 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:56:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 12:56:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 12:56:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 57 states have internal predecessors, (70), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 12:56:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2025-03-08 12:56:49,315 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 203 [2025-03-08 12:56:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:49,316 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2025-03-08 12:56:49,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 12:56:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2025-03-08 12:56:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 12:56:49,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:49,318 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:49,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 12:56:49,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:56:49,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:49,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash 183709612, now seen corresponding path program 1 times [2025-03-08 12:56:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:56:49,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795191909] [2025-03-08 12:56:49,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:49,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:56:49,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:56:49,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:56:49,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:56:49,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 12:56:49,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 12:56:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:49,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:49,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 12:56:49,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:56:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1080 proven. 147 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-08 12:56:50,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:56:52,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:56:52,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795191909] [2025-03-08 12:56:52,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795191909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:56:52,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [302975995] [2025-03-08 12:56:52,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:52,897 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 12:56:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 12:56:52,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 12:56:52,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 12:56:52,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 12:56:54,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 12:56:54,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:54,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:54,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 12:56:54,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:56:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1120 proven. 102 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-03-08 12:56:54,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:56:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [302975995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:56:55,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:56:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2025-03-08 12:56:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336947837] [2025-03-08 12:56:55,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:56:55,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 12:56:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:56:55,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 12:56:55,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2025-03-08 12:56:55,931 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-08 12:56:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:56:56,604 INFO L93 Difference]: Finished difference Result 277 states and 393 transitions. [2025-03-08 12:56:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 12:56:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) Word has length 204 [2025-03-08 12:56:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:56:56,608 INFO L225 Difference]: With dead ends: 277 [2025-03-08 12:56:56,608 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 12:56:56,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=304, Unknown=0, NotChecked=0, Total=506 [2025-03-08 12:56:56,610 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:56:56,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 509 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:56:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 12:56:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2025-03-08 12:56:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 103 states have (on average 1.1650485436893203) internal successors, (120), 103 states have internal predecessors, (120), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 12:56:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2025-03-08 12:56:56,635 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 204 [2025-03-08 12:56:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:56:56,635 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2025-03-08 12:56:56,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 11 states have internal predecessors, (84), 5 states have call successors, (49), 5 states have call predecessors, (49), 7 states have return successors, (50), 5 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-08 12:56:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2025-03-08 12:56:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 12:56:56,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:56:56,637 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:56:56,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 12:56:56,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 12:56:57,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 12:56:57,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:56:57,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:56:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1691261421, now seen corresponding path program 1 times [2025-03-08 12:56:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:56:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170689140] [2025-03-08 12:56:57,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:56:57,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:56:57,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:56:57,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:56:57,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 12:56:57,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 12:56:57,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 12:56:57,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:56:57,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:56:57,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 12:56:57,381 INFO L279 TraceCheckSpWp]: Computing forward predicates...