./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.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-pr-co_file-3.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 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:36:39,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:36:39,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:36:39,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:36:39,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:36:39,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:36:39,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:36:39,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:36:39,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:36:39,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:36:39,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:36:39,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:36:39,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:36:39,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:36:39,120 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:36:39,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:36:39,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:36:39,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:36:39,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:36:39,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:36:39,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:36:39,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:36:39,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:36:39,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:36:39,122 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:36:39,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:36:39,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:36:39,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:36:39,123 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 -> 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349 [2025-03-08 12:36:39,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:36:39,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:36:39,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:36:39,358 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:36:39,358 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:36:39,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-03-08 12:36:40,464 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263fbd573/02fe761122264000a82db13976e59d12/FLAG1bad29d05 [2025-03-08 12:36:40,753 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:36:40,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-03-08 12:36:40,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263fbd573/02fe761122264000a82db13976e59d12/FLAG1bad29d05 [2025-03-08 12:36:41,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/263fbd573/02fe761122264000a82db13976e59d12 [2025-03-08 12:36:41,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:36:41,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:36:41,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:36:41,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:36:41,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:36:41,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10898c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41, skipping insertion in model container [2025-03-08 12:36:41,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:36:41,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i[918,931] [2025-03-08 12:36:41,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:36:41,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:36:41,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i[918,931] [2025-03-08 12:36:41,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:36:41,255 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:36:41,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41 WrapperNode [2025-03-08 12:36:41,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:36:41,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:36:41,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:36:41,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:36:41,261 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:36:41" (1/1) ... [2025-03-08 12:36:41,268 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:36:41" (1/1) ... [2025-03-08 12:36:41,302 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-03-08 12:36:41,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:36:41,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:36:41,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:36:41,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:36:41,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,333 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:36:41,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:36:41,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:36:41,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:36:41,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:36:41,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (1/1) ... [2025-03-08 12:36:41,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:36:41,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:36:41,408 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:36:41,412 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:36:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:36:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:36:41,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:36:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:36:41,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:36:41,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:36:41,493 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:36:41,494 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:36:41,968 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-03-08 12:36:41,998 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 12:36:41,998 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:36:42,022 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:36:42,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:36:42,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:36:42 BoogieIcfgContainer [2025-03-08 12:36:42,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:36:42,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:36:42,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:36:42,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:36:42,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:36:41" (1/3) ... [2025-03-08 12:36:42,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc36b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:36:42, skipping insertion in model container [2025-03-08 12:36:42,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:41" (2/3) ... [2025-03-08 12:36:42,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc36b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:36:42, skipping insertion in model container [2025-03-08 12:36:42,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:36:42" (3/3) ... [2025-03-08 12:36:42,032 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-03-08 12:36:42,043 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:36:42,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:36:42,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:36:42,092 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;@72f4de3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:36:42,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:36:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 12:36:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 12:36:42,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:42,112 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:42,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1884464851, now seen corresponding path program 1 times [2025-03-08 12:36:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010813374] [2025-03-08 12:36:42,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:42,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 12:36:42,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 12:36:42,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:42,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 12:36:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010813374] [2025-03-08 12:36:42,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010813374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:36:42,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188205909] [2025-03-08 12:36:42,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:36:42,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:36:42,444 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:36:42,445 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:36:42,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 12:36:42,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 12:36:42,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:42,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:36:42,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:36:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 12:36:42,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:36:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188205909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:36:42,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:36:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853693109] [2025-03-08 12:36:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:42,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:36:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:42,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:36:42,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:36:42,700 INFO L87 Difference]: Start difference. First operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:36:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:42,741 INFO L93 Difference]: Finished difference Result 238 states and 421 transitions. [2025-03-08 12:36:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:36:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221 [2025-03-08 12:36:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:42,749 INFO L225 Difference]: With dead ends: 238 [2025-03-08 12:36:42,750 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 12:36:42,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 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:36:42,757 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:42,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:36:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 12:36:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 12:36:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 12:36:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 188 transitions. [2025-03-08 12:36:42,803 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 188 transitions. Word has length 221 [2025-03-08 12:36:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:42,803 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 188 transitions. [2025-03-08 12:36:42,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:36:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 188 transitions. [2025-03-08 12:36:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 12:36:42,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:42,809 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,816 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:36:43,010 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:36:43,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -543114778, now seen corresponding path program 1 times [2025-03-08 12:36:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439721915] [2025-03-08 12:36:43,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:43,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 12:36:43,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 12:36:43,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:43,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:43,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439721915] [2025-03-08 12:36:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439721915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:36:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766647643] [2025-03-08 12:36:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:43,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:36:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:43,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:36:43,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:36:43,524 INFO L87 Difference]: Start difference. First operand 119 states and 188 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:43,642 INFO L93 Difference]: Finished difference Result 351 states and 558 transitions. [2025-03-08 12:36:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:36:43,644 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-03-08 12:36:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:43,646 INFO L225 Difference]: With dead ends: 351 [2025-03-08 12:36:43,646 INFO L226 Difference]: Without dead ends: 235 [2025-03-08 12:36:43,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:36:43,651 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 110 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:43,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 348 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:36:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-08 12:36:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2025-03-08 12:36:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 162 states have internal predecessors, (232), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:36:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 368 transitions. [2025-03-08 12:36:43,709 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 368 transitions. Word has length 223 [2025-03-08 12:36:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:43,710 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 368 transitions. [2025-03-08 12:36:43,711 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 368 transitions. [2025-03-08 12:36:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 12:36:43,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:43,714 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:43,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:36:43,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:43,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1480371505, now seen corresponding path program 1 times [2025-03-08 12:36:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:43,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216205722] [2025-03-08 12:36:43,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:43,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:43,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 12:36:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 12:36:43,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216205722] [2025-03-08 12:36:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216205722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:36:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798440032] [2025-03-08 12:36:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:43,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:36:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:43,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:36:43,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:36:43,842 INFO L87 Difference]: Start difference. First operand 233 states and 368 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:43,902 INFO L93 Difference]: Finished difference Result 573 states and 904 transitions. [2025-03-08 12:36:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:36:43,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-03-08 12:36:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:43,905 INFO L225 Difference]: With dead ends: 573 [2025-03-08 12:36:43,905 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 12:36:43,906 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:36:43,907 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 78 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:43,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 412 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:36:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 12:36:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 285. [2025-03-08 12:36:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 214 states have (on average 1.485981308411215) internal successors, (318), 214 states have internal predecessors, (318), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 12:36:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 454 transitions. [2025-03-08 12:36:43,946 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 454 transitions. Word has length 224 [2025-03-08 12:36:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:43,947 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 454 transitions. [2025-03-08 12:36:43,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 454 transitions. [2025-03-08 12:36:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 12:36:43,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:43,950 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:43,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:36:43,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:43,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash 747287635, now seen corresponding path program 1 times [2025-03-08 12:36:43,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:43,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45088413] [2025-03-08 12:36:43,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:43,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 12:36:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 12:36:43,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:43,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45088413] [2025-03-08 12:36:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45088413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:44,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:36:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782016501] [2025-03-08 12:36:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:36:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:44,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:36:44,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:36:44,108 INFO L87 Difference]: Start difference. First operand 285 states and 454 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:44,233 INFO L93 Difference]: Finished difference Result 829 states and 1330 transitions. [2025-03-08 12:36:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:36:44,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-03-08 12:36:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:44,237 INFO L225 Difference]: With dead ends: 829 [2025-03-08 12:36:44,240 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 12:36:44,241 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:36:44,242 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 165 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:44,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 477 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:36:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 12:36:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-03-08 12:36:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 404 states have (on average 1.4653465346534653) internal successors, (592), 404 states have internal predecessors, (592), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 12:36:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 864 transitions. [2025-03-08 12:36:44,296 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 864 transitions. Word has length 224 [2025-03-08 12:36:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:44,298 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 864 transitions. [2025-03-08 12:36:44,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 864 transitions. [2025-03-08 12:36:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 12:36:44,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:44,300 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:36:44,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:44,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:44,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1868530045, now seen corresponding path program 1 times [2025-03-08 12:36:44,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820837289] [2025-03-08 12:36:44,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:44,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 12:36:44,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 12:36:44,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:44,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820837289] [2025-03-08 12:36:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820837289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:44,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:36:44,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996437981] [2025-03-08 12:36:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:44,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:36:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:44,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:36:44,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:36:44,647 INFO L87 Difference]: Start difference. First operand 545 states and 864 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:44,979 INFO L93 Difference]: Finished difference Result 1633 states and 2591 transitions. [2025-03-08 12:36:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:36:44,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 225 [2025-03-08 12:36:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:44,985 INFO L225 Difference]: With dead ends: 1633 [2025-03-08 12:36:44,986 INFO L226 Difference]: Without dead ends: 1091 [2025-03-08 12:36:44,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:36:44,988 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 124 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:44,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 699 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:36:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-03-08 12:36:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1083. [2025-03-08 12:36:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 802 states have (on average 1.458852867830424) internal successors, (1170), 802 states have internal predecessors, (1170), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-08 12:36:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1714 transitions. [2025-03-08 12:36:45,079 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1714 transitions. Word has length 225 [2025-03-08 12:36:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:45,079 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1714 transitions. [2025-03-08 12:36:45,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1714 transitions. [2025-03-08 12:36:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 12:36:45,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:45,082 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:36:45,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:45,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1226261957, now seen corresponding path program 1 times [2025-03-08 12:36:45,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:45,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286488445] [2025-03-08 12:36:45,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:45,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 12:36:45,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 12:36:45,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:45,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:45,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286488445] [2025-03-08 12:36:45,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286488445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:45,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:45,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:36:45,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633764360] [2025-03-08 12:36:45,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:45,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:36:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:45,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:36:45,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:36:45,334 INFO L87 Difference]: Start difference. First operand 1083 states and 1714 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:45,497 INFO L93 Difference]: Finished difference Result 2725 states and 4322 transitions. [2025-03-08 12:36:45,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:36:45,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-03-08 12:36:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:45,510 INFO L225 Difference]: With dead ends: 2725 [2025-03-08 12:36:45,510 INFO L226 Difference]: Without dead ends: 1645 [2025-03-08 12:36:45,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:36:45,514 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 117 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:45,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 349 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:36:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-03-08 12:36:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1643. [2025-03-08 12:36:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1222 states have (on average 1.4549918166939444) internal successors, (1778), 1222 states have internal predecessors, (1778), 408 states have call successors, (408), 12 states have call predecessors, (408), 12 states have return successors, (408), 408 states have call predecessors, (408), 408 states have call successors, (408) [2025-03-08 12:36:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2594 transitions. [2025-03-08 12:36:45,610 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2594 transitions. Word has length 226 [2025-03-08 12:36:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:45,610 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2594 transitions. [2025-03-08 12:36:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2594 transitions. [2025-03-08 12:36:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 12:36:45,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:45,613 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:36:45,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1214945830, now seen corresponding path program 1 times [2025-03-08 12:36:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566690103] [2025-03-08 12:36:45,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:45,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 12:36:45,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 12:36:45,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:45,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:45,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:45,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566690103] [2025-03-08 12:36:45,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566690103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:45,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:45,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:36:45,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522165759] [2025-03-08 12:36:45,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:45,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:36:45,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:45,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:36:45,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:36:45,914 INFO L87 Difference]: Start difference. First operand 1643 states and 2594 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:46,247 INFO L93 Difference]: Finished difference Result 2725 states and 4306 transitions. [2025-03-08 12:36:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:36:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-03-08 12:36:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:46,258 INFO L225 Difference]: With dead ends: 2725 [2025-03-08 12:36:46,259 INFO L226 Difference]: Without dead ends: 1645 [2025-03-08 12:36:46,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:36:46,264 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 153 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:46,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 630 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:36:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-03-08 12:36:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1643. [2025-03-08 12:36:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1222 states have (on average 1.4517184942716859) internal successors, (1774), 1222 states have internal predecessors, (1774), 408 states have call successors, (408), 12 states have call predecessors, (408), 12 states have return successors, (408), 408 states have call predecessors, (408), 408 states have call successors, (408) [2025-03-08 12:36:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2590 transitions. [2025-03-08 12:36:46,364 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2590 transitions. Word has length 226 [2025-03-08 12:36:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:46,365 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2590 transitions. [2025-03-08 12:36:46,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2590 transitions. [2025-03-08 12:36:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 12:36:46,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:46,367 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:36:46,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:46,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2001744758, now seen corresponding path program 1 times [2025-03-08 12:36:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546360139] [2025-03-08 12:36:46,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:46,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:36:46,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:36:46,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:46,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:46,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:46,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546360139] [2025-03-08 12:36:46,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546360139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:46,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:46,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:36:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838671423] [2025-03-08 12:36:46,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:46,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:36:46,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:46,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:36:46,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:36:46,789 INFO L87 Difference]: Start difference. First operand 1643 states and 2590 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:48,132 INFO L93 Difference]: Finished difference Result 7819 states and 12167 transitions. [2025-03-08 12:36:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:36:48,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 227 [2025-03-08 12:36:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:48,183 INFO L225 Difference]: With dead ends: 7819 [2025-03-08 12:36:48,184 INFO L226 Difference]: Without dead ends: 6179 [2025-03-08 12:36:48,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:36:48,189 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 767 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:48,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 591 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:36:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2025-03-08 12:36:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5122. [2025-03-08 12:36:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5122 states, 3721 states have (on average 1.416285944638538) internal successors, (5270), 3742 states have internal predecessors, (5270), 1351 states have call successors, (1351), 49 states have call predecessors, (1351), 49 states have return successors, (1351), 1330 states have call predecessors, (1351), 1351 states have call successors, (1351) [2025-03-08 12:36:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 7972 transitions. [2025-03-08 12:36:48,600 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 7972 transitions. Word has length 227 [2025-03-08 12:36:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:48,601 INFO L471 AbstractCegarLoop]: Abstraction has 5122 states and 7972 transitions. [2025-03-08 12:36:48,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 7972 transitions. [2025-03-08 12:36:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 12:36:48,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:48,604 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:48,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:36:48,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:48,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -258934423, now seen corresponding path program 1 times [2025-03-08 12:36:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932703497] [2025-03-08 12:36:48,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:48,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:36:48,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:36:48,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:48,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 12:36:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932703497] [2025-03-08 12:36:48,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932703497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:36:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339401524] [2025-03-08 12:36:48,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:48,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:36:48,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:36:48,850 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:36:48,852 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:36:48,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 12:36:48,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 12:36:48,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:48,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:48,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 12:36:48,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:36:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-03-08 12:36:49,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:36:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 12:36:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339401524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:36:49,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:36:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 12:36:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690554211] [2025-03-08 12:36:49,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:36:49,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:36:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:49,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:36:49,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:36:49,408 INFO L87 Difference]: Start difference. First operand 5122 states and 7972 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-08 12:36:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:50,281 INFO L93 Difference]: Finished difference Result 11375 states and 17670 transitions. [2025-03-08 12:36:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 12:36:50,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 227 [2025-03-08 12:36:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:50,320 INFO L225 Difference]: With dead ends: 11375 [2025-03-08 12:36:50,320 INFO L226 Difference]: Without dead ends: 6067 [2025-03-08 12:36:50,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:36:50,338 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 399 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:50,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 653 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:36:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2025-03-08 12:36:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 4801. [2025-03-08 12:36:50,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4801 states, 3528 states have (on average 1.4229024943310657) internal successors, (5020), 3528 states have internal predecessors, (5020), 1190 states have call successors, (1190), 82 states have call predecessors, (1190), 82 states have return successors, (1190), 1190 states have call predecessors, (1190), 1190 states have call successors, (1190) [2025-03-08 12:36:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 7400 transitions. [2025-03-08 12:36:50,737 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 7400 transitions. Word has length 227 [2025-03-08 12:36:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:50,738 INFO L471 AbstractCegarLoop]: Abstraction has 4801 states and 7400 transitions. [2025-03-08 12:36:50,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-08 12:36:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 7400 transitions. [2025-03-08 12:36:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:36:50,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:50,743 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:50,752 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:36:50,944 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,SelfDestructingSolverStorable8 [2025-03-08 12:36:50,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1600365532, now seen corresponding path program 1 times [2025-03-08 12:36:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:50,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740886002] [2025-03-08 12:36:50,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:50,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:36:50,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:36:50,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:50,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740886002] [2025-03-08 12:36:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740886002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:36:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627634126] [2025-03-08 12:36:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:51,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:36:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:51,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:36:51,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:36:51,113 INFO L87 Difference]: Start difference. First operand 4801 states and 7400 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:52,153 INFO L93 Difference]: Finished difference Result 12584 states and 19420 transitions. [2025-03-08 12:36:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:36:52,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-03-08 12:36:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:52,208 INFO L225 Difference]: With dead ends: 12584 [2025-03-08 12:36:52,209 INFO L226 Difference]: Without dead ends: 7408 [2025-03-08 12:36:52,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:36:52,227 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 745 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:52,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 695 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:36:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2025-03-08 12:36:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7245. [2025-03-08 12:36:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7245 states, 5321 states have (on average 1.3991730877654576) internal successors, (7445), 5321 states have internal predecessors, (7445), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802) [2025-03-08 12:36:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7245 states to 7245 states and 11049 transitions. [2025-03-08 12:36:52,808 INFO L78 Accepts]: Start accepts. Automaton has 7245 states and 11049 transitions. Word has length 228 [2025-03-08 12:36:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:52,809 INFO L471 AbstractCegarLoop]: Abstraction has 7245 states and 11049 transitions. [2025-03-08 12:36:52,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7245 states and 11049 transitions. [2025-03-08 12:36:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:36:52,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:52,814 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:52,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:36:52,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1345628987, now seen corresponding path program 1 times [2025-03-08 12:36:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68990099] [2025-03-08 12:36:52,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:36:52,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:36:52,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:52,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68990099] [2025-03-08 12:36:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68990099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:53,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:53,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:36:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182867745] [2025-03-08 12:36:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:53,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:36:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:53,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:36:53,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:36:53,128 INFO L87 Difference]: Start difference. First operand 7245 states and 11049 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:53,594 INFO L93 Difference]: Finished difference Result 14492 states and 22099 transitions. [2025-03-08 12:36:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:36:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-03-08 12:36:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:53,634 INFO L225 Difference]: With dead ends: 14492 [2025-03-08 12:36:53,634 INFO L226 Difference]: Without dead ends: 7250 [2025-03-08 12:36:53,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:36:53,655 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 111 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:53,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 346 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:36:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7250 states. [2025-03-08 12:36:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 7245. [2025-03-08 12:36:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7245 states, 5321 states have (on average 1.397481676376621) internal successors, (7436), 5321 states have internal predecessors, (7436), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802) [2025-03-08 12:36:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7245 states to 7245 states and 11040 transitions. [2025-03-08 12:36:54,088 INFO L78 Accepts]: Start accepts. Automaton has 7245 states and 11040 transitions. Word has length 228 [2025-03-08 12:36:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:54,089 INFO L471 AbstractCegarLoop]: Abstraction has 7245 states and 11040 transitions. [2025-03-08 12:36:54,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7245 states and 11040 transitions. [2025-03-08 12:36:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:36:54,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:54,092 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:36:54,092 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:54,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 994829050, now seen corresponding path program 1 times [2025-03-08 12:36:54,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:54,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318125300] [2025-03-08 12:36:54,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:54,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:36:54,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:36:54,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:54,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318125300] [2025-03-08 12:36:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318125300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:36:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490884743] [2025-03-08 12:36:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:54,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:36:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:54,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:36:54,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:36:54,632 INFO L87 Difference]: Start difference. First operand 7245 states and 11040 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:55,231 INFO L93 Difference]: Finished difference Result 17735 states and 26420 transitions. [2025-03-08 12:36:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:36:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-03-08 12:36:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:55,274 INFO L225 Difference]: With dead ends: 17735 [2025-03-08 12:36:55,275 INFO L226 Difference]: Without dead ends: 10493 [2025-03-08 12:36:55,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:36:55,295 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 200 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:55,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 770 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:36:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10493 states. [2025-03-08 12:36:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10493 to 8735. [2025-03-08 12:36:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 6811 states have (on average 1.3958302745558655) internal successors, (9507), 6811 states have internal predecessors, (9507), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802) [2025-03-08 12:36:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 13111 transitions. [2025-03-08 12:36:56,006 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 13111 transitions. Word has length 228 [2025-03-08 12:36:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:56,007 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 13111 transitions. [2025-03-08 12:36:56,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:36:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 13111 transitions. [2025-03-08 12:36:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:36:56,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:56,011 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:36:56,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:56,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1394649015, now seen corresponding path program 1 times [2025-03-08 12:36:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:56,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711445299] [2025-03-08 12:36:56,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:56,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:36:56,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:36:56,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:56,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:36:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711445299] [2025-03-08 12:36:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711445299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:36:56,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:36:56,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:36:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174180683] [2025-03-08 12:36:56,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:36:56,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:36:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:56,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:36:56,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:36:56,576 INFO L87 Difference]: Start difference. First operand 8735 states and 13111 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-08 12:36:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:36:57,355 INFO L93 Difference]: Finished difference Result 17499 states and 26265 transitions. [2025-03-08 12:36:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:36:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 228 [2025-03-08 12:36:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:36:57,391 INFO L225 Difference]: With dead ends: 17499 [2025-03-08 12:36:57,391 INFO L226 Difference]: Without dead ends: 8767 [2025-03-08 12:36:57,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:36:57,411 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 150 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:36:57,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 741 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:36:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8767 states. [2025-03-08 12:36:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8767 to 8753. [2025-03-08 12:36:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8753 states, 6829 states have (on average 1.3956655440035144) internal successors, (9531), 6829 states have internal predecessors, (9531), 1802 states have call successors, (1802), 121 states have call predecessors, (1802), 121 states have return successors, (1802), 1802 states have call predecessors, (1802), 1802 states have call successors, (1802) [2025-03-08 12:36:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 13135 transitions. [2025-03-08 12:36:57,803 INFO L78 Accepts]: Start accepts. Automaton has 8753 states and 13135 transitions. Word has length 228 [2025-03-08 12:36:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:36:57,803 INFO L471 AbstractCegarLoop]: Abstraction has 8753 states and 13135 transitions. [2025-03-08 12:36:57,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-08 12:36:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8753 states and 13135 transitions. [2025-03-08 12:36:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 12:36:57,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:36:57,806 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:57,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 12:36:57,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:36:57,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:36:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1803473240, now seen corresponding path program 1 times [2025-03-08 12:36:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:36:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939635651] [2025-03-08 12:36:57,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:36:57,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:36:57,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:36:57,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:57,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 12:36:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:36:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939635651] [2025-03-08 12:36:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939635651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:36:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483267301] [2025-03-08 12:36:58,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:36:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:36:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:36:58,100 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:36:58,102 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:36:58,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 12:36:58,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 12:36:58,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:36:58,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:36:58,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 12:36:58,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:36:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-03-08 12:36:58,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:36:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 12:36:58,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483267301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:36:58,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:36:58,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-03-08 12:36:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259891048] [2025-03-08 12:36:58,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:36:58,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 12:36:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:36:58,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 12:36:58,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:36:58,966 INFO L87 Difference]: Start difference. First operand 8753 states and 13135 transitions. Second operand has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-03-08 12:37:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:00,192 INFO L93 Difference]: Finished difference Result 19891 states and 29618 transitions. [2025-03-08 12:37:00,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 12:37:00,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 228 [2025-03-08 12:37:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:00,232 INFO L225 Difference]: With dead ends: 19891 [2025-03-08 12:37:00,233 INFO L226 Difference]: Without dead ends: 11141 [2025-03-08 12:37:00,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-03-08 12:37:00,246 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 838 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:00,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 733 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:37:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11141 states. [2025-03-08 12:37:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11141 to 10887. [2025-03-08 12:37:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10887 states, 8291 states have (on average 1.3566517910987819) internal successors, (11248), 8321 states have internal predecessors, (11248), 2432 states have call successors, (2432), 163 states have call predecessors, (2432), 163 states have return successors, (2432), 2402 states have call predecessors, (2432), 2432 states have call successors, (2432) [2025-03-08 12:37:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 16112 transitions. [2025-03-08 12:37:00,843 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 16112 transitions. Word has length 228 [2025-03-08 12:37:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:00,844 INFO L471 AbstractCegarLoop]: Abstraction has 10887 states and 16112 transitions. [2025-03-08 12:37:00,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.714285714285714) internal successors, (150), 14 states have internal predecessors, (150), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-03-08 12:37:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 16112 transitions. [2025-03-08 12:37:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 12:37:00,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:00,848 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:00,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 12:37:01,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:01,053 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1654468443, now seen corresponding path program 1 times [2025-03-08 12:37:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:01,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901429557] [2025-03-08 12:37:01,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:01,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 12:37:01,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 12:37:01,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:01,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 12:37:02,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901429557] [2025-03-08 12:37:02,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901429557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:37:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409596918] [2025-03-08 12:37:02,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:02,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:02,107 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:37:02,109 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:37:02,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 12:37:02,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 12:37:02,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:02,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:02,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 12:37:02,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:37:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1277 proven. 177 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-08 12:37:03,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:37:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 12:37:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409596918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:37:03,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:37:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 7] total 24 [2025-03-08 12:37:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664050195] [2025-03-08 12:37:03,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:37:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 12:37:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:03,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 12:37:03,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-03-08 12:37:03,646 INFO L87 Difference]: Start difference. First operand 10887 states and 16112 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 7 states have call successors, (81), 5 states have call predecessors, (81), 9 states have return successors, (82), 7 states have call predecessors, (82), 7 states have call successors, (82) [2025-03-08 12:37:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:06,984 INFO L93 Difference]: Finished difference Result 29854 states and 42534 transitions. [2025-03-08 12:37:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-08 12:37:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 7 states have call successors, (81), 5 states have call predecessors, (81), 9 states have return successors, (82), 7 states have call predecessors, (82), 7 states have call successors, (82) Word has length 229 [2025-03-08 12:37:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:07,052 INFO L225 Difference]: With dead ends: 29854 [2025-03-08 12:37:07,052 INFO L226 Difference]: Without dead ends: 22574 [2025-03-08 12:37:07,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1380, Invalid=4472, Unknown=0, NotChecked=0, Total=5852 [2025-03-08 12:37:07,069 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 2029 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:07,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 1276 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 12:37:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2025-03-08 12:37:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 13202. [2025-03-08 12:37:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13202 states, 10550 states have (on average 1.3222748815165877) internal successors, (13950), 10627 states have internal predecessors, (13950), 2265 states have call successors, (2265), 386 states have call predecessors, (2265), 386 states have return successors, (2265), 2188 states have call predecessors, (2265), 2265 states have call successors, (2265) [2025-03-08 12:37:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13202 states to 13202 states and 18480 transitions. [2025-03-08 12:37:08,112 INFO L78 Accepts]: Start accepts. Automaton has 13202 states and 18480 transitions. Word has length 229 [2025-03-08 12:37:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:08,113 INFO L471 AbstractCegarLoop]: Abstraction has 13202 states and 18480 transitions. [2025-03-08 12:37:08,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 23 states have internal predecessors, (135), 7 states have call successors, (81), 5 states have call predecessors, (81), 9 states have return successors, (82), 7 states have call predecessors, (82), 7 states have call successors, (82) [2025-03-08 12:37:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 13202 states and 18480 transitions. [2025-03-08 12:37:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 12:37:08,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:08,115 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:08,122 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:37:08,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 12:37:08,316 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:08,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:08,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1721578104, now seen corresponding path program 1 times [2025-03-08 12:37:08,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:08,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975588484] [2025-03-08 12:37:08,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:08,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:08,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 12:37:08,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 12:37:08,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:08,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:37:08,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:08,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975588484] [2025-03-08 12:37:08,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975588484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:08,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:08,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:37:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269594858] [2025-03-08 12:37:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:37:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:08,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:37:08,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:08,517 INFO L87 Difference]: Start difference. First operand 13202 states and 18480 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:37:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:09,711 INFO L93 Difference]: Finished difference Result 26898 states and 37644 transitions. [2025-03-08 12:37:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:37:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 230 [2025-03-08 12:37:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:09,760 INFO L225 Difference]: With dead ends: 26898 [2025-03-08 12:37:09,760 INFO L226 Difference]: Without dead ends: 14726 [2025-03-08 12:37:09,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:37:09,783 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 504 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:09,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 577 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:37:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14726 states. [2025-03-08 12:37:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14726 to 13647. [2025-03-08 12:37:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13647 states, 10946 states have (on average 1.3225835921797917) internal successors, (14477), 11030 states have internal predecessors, (14477), 2307 states have call successors, (2307), 393 states have call predecessors, (2307), 393 states have return successors, (2307), 2223 states have call predecessors, (2307), 2307 states have call successors, (2307) [2025-03-08 12:37:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13647 states to 13647 states and 19091 transitions. [2025-03-08 12:37:11,279 INFO L78 Accepts]: Start accepts. Automaton has 13647 states and 19091 transitions. Word has length 230 [2025-03-08 12:37:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:11,279 INFO L471 AbstractCegarLoop]: Abstraction has 13647 states and 19091 transitions. [2025-03-08 12:37:11,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:37:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13647 states and 19091 transitions. [2025-03-08 12:37:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 12:37:11,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:11,282 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 12:37:11,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:11,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash -83654911, now seen corresponding path program 1 times [2025-03-08 12:37:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686974890] [2025-03-08 12:37:11,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:11,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 12:37:11,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 12:37:11,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:11,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 192 refuted. 0 times theorem prover too weak. 1965 trivial. 0 not checked. [2025-03-08 12:37:12,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686974890] [2025-03-08 12:37:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686974890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:37:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636152085] [2025-03-08 12:37:12,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:12,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:12,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:12,125 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:37:12,126 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:37:12,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 12:37:12,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 12:37:12,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:12,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:12,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 12:37:12,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:37:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1187 proven. 282 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-03-08 12:37:13,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:37:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 201 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2025-03-08 12:37:14,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636152085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:37:14,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:37:14,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 12] total 29 [2025-03-08 12:37:14,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600821067] [2025-03-08 12:37:14,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:37:14,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 12:37:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:14,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 12:37:14,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2025-03-08 12:37:14,187 INFO L87 Difference]: Start difference. First operand 13647 states and 19091 transitions. Second operand has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91) [2025-03-08 12:37:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:16,295 INFO L93 Difference]: Finished difference Result 22937 states and 31886 transitions. [2025-03-08 12:37:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 12:37:16,296 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91) Word has length 230 [2025-03-08 12:37:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:16,337 INFO L225 Difference]: With dead ends: 22937 [2025-03-08 12:37:16,337 INFO L226 Difference]: Without dead ends: 9293 [2025-03-08 12:37:16,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=769, Invalid=1781, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 12:37:16,359 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 877 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:16,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 879 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:37:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9293 states. [2025-03-08 12:37:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 8020. [2025-03-08 12:37:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8020 states, 6531 states have (on average 1.3327208696983617) internal successors, (8704), 6576 states have internal predecessors, (8704), 1213 states have call successors, (1213), 275 states have call predecessors, (1213), 275 states have return successors, (1213), 1168 states have call predecessors, (1213), 1213 states have call successors, (1213) [2025-03-08 12:37:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8020 states to 8020 states and 11130 transitions. [2025-03-08 12:37:17,163 INFO L78 Accepts]: Start accepts. Automaton has 8020 states and 11130 transitions. Word has length 230 [2025-03-08 12:37:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:17,164 INFO L471 AbstractCegarLoop]: Abstraction has 8020 states and 11130 transitions. [2025-03-08 12:37:17,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.103448275862069) internal successors, (148), 29 states have internal predecessors, (148), 11 states have call successors, (89), 5 states have call predecessors, (89), 11 states have return successors, (91), 10 states have call predecessors, (91), 11 states have call successors, (91) [2025-03-08 12:37:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 8020 states and 11130 transitions. [2025-03-08 12:37:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-08 12:37:17,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:17,167 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 12:37:17,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 12:37:17,371 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1130856321, now seen corresponding path program 1 times [2025-03-08 12:37:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137786716] [2025-03-08 12:37:17,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:17,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-08 12:37:17,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-08 12:37:17,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:17,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:37:17,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137786716] [2025-03-08 12:37:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137786716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 12:37:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108650694] [2025-03-08 12:37:17,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:17,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:37:17,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:17,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:37:17,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:37:17,673 INFO L87 Difference]: Start difference. First operand 8020 states and 11130 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:19,618 INFO L93 Difference]: Finished difference Result 20139 states and 27811 transitions. [2025-03-08 12:37:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 12:37:19,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 231 [2025-03-08 12:37:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:19,662 INFO L225 Difference]: With dead ends: 20139 [2025-03-08 12:37:19,662 INFO L226 Difference]: Without dead ends: 13871 [2025-03-08 12:37:19,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-03-08 12:37:19,675 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 916 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:19,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 965 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:37:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2025-03-08 12:37:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 10924. [2025-03-08 12:37:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10924 states, 8781 states have (on average 1.3274114565539232) internal successors, (11656), 8832 states have internal predecessors, (11656), 1747 states have call successors, (1747), 395 states have call predecessors, (1747), 395 states have return successors, (1747), 1696 states have call predecessors, (1747), 1747 states have call successors, (1747) [2025-03-08 12:37:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10924 states to 10924 states and 15150 transitions. [2025-03-08 12:37:20,716 INFO L78 Accepts]: Start accepts. Automaton has 10924 states and 15150 transitions. Word has length 231 [2025-03-08 12:37:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:20,716 INFO L471 AbstractCegarLoop]: Abstraction has 10924 states and 15150 transitions. [2025-03-08 12:37:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 10924 states and 15150 transitions. [2025-03-08 12:37:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-08 12:37:20,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:20,718 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 12:37:20,718 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1791235437, now seen corresponding path program 1 times [2025-03-08 12:37:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507835390] [2025-03-08 12:37:20,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:20,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-08 12:37:20,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-08 12:37:20,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:20,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:37:21,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:21,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507835390] [2025-03-08 12:37:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507835390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:21,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:21,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:37:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538586962] [2025-03-08 12:37:21,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:21,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:37:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:21,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:37:21,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:37:21,151 INFO L87 Difference]: Start difference. First operand 10924 states and 15150 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:37:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:23,017 INFO L93 Difference]: Finished difference Result 22789 states and 31525 transitions. [2025-03-08 12:37:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:37:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 231 [2025-03-08 12:37:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:23,066 INFO L225 Difference]: With dead ends: 22789 [2025-03-08 12:37:23,066 INFO L226 Difference]: Without dead ends: 11868 [2025-03-08 12:37:23,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:37:23,087 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 432 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:23,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 693 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:37:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2025-03-08 12:37:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 11810. [2025-03-08 12:37:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11810 states, 9624 states have (on average 1.325436408977556) internal successors, (12756), 9687 states have internal predecessors, (12756), 1771 states have call successors, (1771), 414 states have call predecessors, (1771), 414 states have return successors, (1771), 1708 states have call predecessors, (1771), 1771 states have call successors, (1771) [2025-03-08 12:37:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 16298 transitions. [2025-03-08 12:37:24,050 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 16298 transitions. Word has length 231 [2025-03-08 12:37:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:24,051 INFO L471 AbstractCegarLoop]: Abstraction has 11810 states and 16298 transitions. [2025-03-08 12:37:24,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 12:37:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 16298 transitions. [2025-03-08 12:37:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-08 12:37:24,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:24,053 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:24,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 12:37:24,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:24,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1537625582, now seen corresponding path program 1 times [2025-03-08 12:37:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:24,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367756683] [2025-03-08 12:37:24,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:24,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:24,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-08 12:37:24,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-08 12:37:24,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:24,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:37:24,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367756683] [2025-03-08 12:37:24,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367756683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:24,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:24,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:37:24,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879445175] [2025-03-08 12:37:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:24,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:37:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:24,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:37:24,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:37:24,259 INFO L87 Difference]: Start difference. First operand 11810 states and 16298 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:26,279 INFO L93 Difference]: Finished difference Result 33622 states and 46473 transitions. [2025-03-08 12:37:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:37:26,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 231 [2025-03-08 12:37:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:26,346 INFO L225 Difference]: With dead ends: 33622 [2025-03-08 12:37:26,347 INFO L226 Difference]: Without dead ends: 21815 [2025-03-08 12:37:26,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:37:26,369 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 303 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:26,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 671 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:37:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21815 states. [2025-03-08 12:37:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21815 to 21795. [2025-03-08 12:37:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21795 states, 17702 states have (on average 1.3241441645011862) internal successors, (23440), 17818 states have internal predecessors, (23440), 3317 states have call successors, (3317), 775 states have call predecessors, (3317), 775 states have return successors, (3317), 3201 states have call predecessors, (3317), 3317 states have call successors, (3317) [2025-03-08 12:37:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21795 states to 21795 states and 30074 transitions. [2025-03-08 12:37:28,474 INFO L78 Accepts]: Start accepts. Automaton has 21795 states and 30074 transitions. Word has length 231 [2025-03-08 12:37:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:28,474 INFO L471 AbstractCegarLoop]: Abstraction has 21795 states and 30074 transitions. [2025-03-08 12:37:28,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21795 states and 30074 transitions. [2025-03-08 12:37:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 12:37:28,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:28,476 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:28,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 12:37:28,477 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:28,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:28,477 INFO L85 PathProgramCache]: Analyzing trace with hash -654552696, now seen corresponding path program 1 times [2025-03-08 12:37:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:28,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350282135] [2025-03-08 12:37:28,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:28,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 12:37:28,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 12:37:28,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:28,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:37:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:28,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350282135] [2025-03-08 12:37:28,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350282135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:28,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:28,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:37:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468799859] [2025-03-08 12:37:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:28,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:37:28,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:28,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:37:28,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:28,624 INFO L87 Difference]: Start difference. First operand 21795 states and 30074 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:30,273 INFO L93 Difference]: Finished difference Result 43587 states and 60145 transitions. [2025-03-08 12:37:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:37:30,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 232 [2025-03-08 12:37:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:30,336 INFO L225 Difference]: With dead ends: 43587 [2025-03-08 12:37:30,336 INFO L226 Difference]: Without dead ends: 21795 [2025-03-08 12:37:30,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:37:30,370 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:30,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:37:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21795 states. [2025-03-08 12:37:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21795 to 21795. [2025-03-08 12:37:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21795 states, 17702 states have (on average 1.307818325612925) internal successors, (23151), 17818 states have internal predecessors, (23151), 3317 states have call successors, (3317), 775 states have call predecessors, (3317), 775 states have return successors, (3317), 3201 states have call predecessors, (3317), 3317 states have call successors, (3317) [2025-03-08 12:37:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21795 states to 21795 states and 29785 transitions. [2025-03-08 12:37:32,930 INFO L78 Accepts]: Start accepts. Automaton has 21795 states and 29785 transitions. Word has length 232 [2025-03-08 12:37:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:32,930 INFO L471 AbstractCegarLoop]: Abstraction has 21795 states and 29785 transitions. [2025-03-08 12:37:32,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 21795 states and 29785 transitions. [2025-03-08 12:37:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 12:37:32,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:32,932 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 12:37:32,932 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:32,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 173343080, now seen corresponding path program 1 times [2025-03-08 12:37:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557980694] [2025-03-08 12:37:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:32,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 12:37:32,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 12:37:32,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:32,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:37:32,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405736334] [2025-03-08 12:37:32,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:32,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:32,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:32,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:37:32,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 12:37:33,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 12:37:33,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 12:37:33,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:33,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:33,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 12:37:33,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:37:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 12:37:33,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:37:33,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:33,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557980694] [2025-03-08 12:37:33,735 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 12:37:33,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405736334] [2025-03-08 12:37:33,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405736334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:33,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:33,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:37:33,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313934262] [2025-03-08 12:37:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:33,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:37:33,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:33,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:37:33,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:37:33,737 INFO L87 Difference]: Start difference. First operand 21795 states and 29785 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:36,081 INFO L93 Difference]: Finished difference Result 45992 states and 62666 transitions. [2025-03-08 12:37:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:37:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 233 [2025-03-08 12:37:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:36,156 INFO L225 Difference]: With dead ends: 45992 [2025-03-08 12:37:36,157 INFO L226 Difference]: Without dead ends: 24200 [2025-03-08 12:37:36,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:37:36,197 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 393 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:36,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 806 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:37:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24200 states. [2025-03-08 12:37:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24200 to 23648. [2025-03-08 12:37:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23648 states, 19271 states have (on average 1.3042914223444555) internal successors, (25135), 19400 states have internal predecessors, (25135), 3553 states have call successors, (3553), 823 states have call predecessors, (3553), 823 states have return successors, (3553), 3424 states have call predecessors, (3553), 3553 states have call successors, (3553) [2025-03-08 12:37:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23648 states to 23648 states and 32241 transitions. [2025-03-08 12:37:38,267 INFO L78 Accepts]: Start accepts. Automaton has 23648 states and 32241 transitions. Word has length 233 [2025-03-08 12:37:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:38,267 INFO L471 AbstractCegarLoop]: Abstraction has 23648 states and 32241 transitions. [2025-03-08 12:37:38,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 12:37:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 23648 states and 32241 transitions. [2025-03-08 12:37:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 12:37:38,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:38,269 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:38,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 12:37:38,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:38,470 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:38,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1134957097, now seen corresponding path program 1 times [2025-03-08 12:37:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114661953] [2025-03-08 12:37:38,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:38,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 12:37:38,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 12:37:38,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:38,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:37:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787480987] [2025-03-08 12:37:38,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:38,525 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:37:38,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 12:37:38,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 12:37:38,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 12:37:38,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:38,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:37:38,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:37:38,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 12:37:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 12:37:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:37:38,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:37:38,822 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:37:38,823 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:37:38,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 12:37:39,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:39,028 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, 1, 1, 1] [2025-03-08 12:37:39,113 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:37:39,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:37:39 BoogieIcfgContainer [2025-03-08 12:37:39,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:37:39,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:37:39,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:37:39,116 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:37:39,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:36:42" (3/4) ... [2025-03-08 12:37:39,119 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:37:39,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:37:39,120 INFO L158 Benchmark]: Toolchain (without parser) took 58085.94ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 111.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 742.6MB. Max. memory is 16.1GB. [2025-03-08 12:37:39,121 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:37:39,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.91ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 94.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:37:39,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.13ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 89.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:37:39,121 INFO L158 Benchmark]: Boogie Preprocessor took 65.04ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 84.4MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:37:39,121 INFO L158 Benchmark]: IcfgBuilder took 655.70ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 49.6MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:37:39,122 INFO L158 Benchmark]: TraceAbstraction took 57088.72ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 49.6MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 683.8MB. Max. memory is 16.1GB. [2025-03-08 12:37:39,122 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 3.7GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:37:39,123 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.91ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 94.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.13ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 89.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.04ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 84.4MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 655.70ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 49.6MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57088.72ms. Allocated memory was 142.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 49.6MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 683.8MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 3.7GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseOr at line 122, overapproximation of bitwiseAnd at line 103, overapproximation of bitwiseAnd at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 168. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] signed short int var_1_28 = 256; [L39] signed long int var_1_30 = -4; [L40] signed short int var_1_31 = 64; [L41] double var_1_32 = 0.0; [L42] double var_1_33 = 3.85; [L43] unsigned short int var_1_34 = 34858; [L44] unsigned short int var_1_35 = 41225; [L45] double var_1_37 = 63.63; [L46] double var_1_38 = 64.6; [L47] signed char var_1_39 = 10; [L48] signed char var_1_40 = -25; [L49] signed char var_1_41 = 4; [L50] unsigned char var_1_42 = 50; [L51] unsigned char var_1_44 = 10; [L52] unsigned char var_1_45 = 16; [L53] unsigned char var_1_47 = 0; [L54] unsigned long int last_1_var_1_10 = 256; [L55] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L194] last_1_var_1_10 = var_1_10 [L195] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L142] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L142] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=-32, var_1_6=256] [L143] var_1_5 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L144] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L145] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L146] var_1_13 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L147] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L148] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L149] var_1_14 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L150] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L151] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L151] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L152] var_1_15 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L153] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L154] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L154] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L155] var_1_16 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L156] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L157] var_1_21 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L158] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L159] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L159] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L160] var_1_22 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L161] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L162] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L162] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=64, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L163] var_1_31 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_31 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L164] RET assume_abort_if_not(var_1_31 >= -32768) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L165] CALL assume_abort_if_not(var_1_31 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L165] RET assume_abort_if_not(var_1_31 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L166] CALL assume_abort_if_not(var_1_31 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L166] RET assume_abort_if_not(var_1_31 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=77/20, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L167] var_1_33 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L168] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L169] var_1_34 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L170] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L171] CALL assume_abort_if_not(var_1_34 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L171] RET assume_abort_if_not(var_1_34 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=41225, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L172] var_1_35 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_35 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L173] RET assume_abort_if_not(var_1_35 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L174] CALL assume_abort_if_not(var_1_35 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L174] RET assume_abort_if_not(var_1_35 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_38=323/5, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L175] var_1_38 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L176] RET assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L177] var_1_40 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L178] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L179] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L179] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=4, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L180] var_1_41 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_41 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L181] RET assume_abort_if_not(var_1_41 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L182] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L182] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=10, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L183] var_1_44 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L184] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L185] CALL assume_abort_if_not(var_1_44 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L185] RET assume_abort_if_not(var_1_44 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=16, var_1_47=0, var_1_5=32, var_1_6=256] [L186] var_1_45 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_47=0, var_1_5=32, var_1_6=256] [L187] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_47=0, var_1_5=32, var_1_6=256] [L188] CALL assume_abort_if_not(var_1_45 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L188] RET assume_abort_if_not(var_1_45 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L189] var_1_47 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_5=32, var_1_6=256] [L190] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_5=32, var_1_6=256] [L191] CALL assume_abort_if_not(var_1_47 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L191] RET assume_abort_if_not(var_1_47 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L206] RET updateVariables() [L207] CALL step() [L59] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L64] COND FALSE !(var_1_10 > var_1_31) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L77] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L78] COND FALSE !(stepLocal_2 > last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L81] var_1_28 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L82] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=5, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L87] COND TRUE var_1_6 >= ((((var_1_23) > (var_1_23)) ? (var_1_23) : (var_1_23))) [L88] var_1_24 = ((((((((var_1_23) > (var_1_6)) ? (var_1_23) : (var_1_6)))) < (var_1_23)) ? (((((var_1_23) > (var_1_6)) ? (var_1_23) : (var_1_6)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L92] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=0, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L93] COND FALSE !(stepLocal_1 || var_1_3) [L98] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L100] EXPR var_1_23 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L100] COND FALSE !(((var_1_23 ^ var_1_20) % var_1_31) > -10) [L103] EXPR var_1_35 & var_1_6 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L103] EXPR (var_1_35 & var_1_6) >> var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_34=32768, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L103] COND TRUE var_1_23 >= ((var_1_35 & var_1_6) >> var_1_20) [L104] var_1_37 = ((((var_1_33) < (var_1_38)) ? (var_1_33) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L106] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L117] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L122] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L122] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L123] COND TRUE var_1_20 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L124] COND TRUE var_1_12 == var_1_12 [L125] var_1_10 = 0u VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L128] EXPR ((((var_1_10) > (-16)) ? (var_1_10) : (-16))) & 16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=0, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L128] COND FALSE !((~ var_1_20) <= (((((var_1_10) > (-16)) ? (var_1_10) : (-16))) & 16)) [L131] COND TRUE var_1_6 <= (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) [L132] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=10, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L137] var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L207] RET step() [L208] CALL, EXPR property() [L198] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L198-L199] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=0, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_24=64, var_1_28=32, var_1_30=-4, var_1_31=-32768, var_1_32=3, var_1_33=3, var_1_34=32768, var_1_35=32767, var_1_37=3, var_1_38=0, var_1_39=0, var_1_3=0, var_1_40=-1, var_1_41=1, var_1_42=50, var_1_44=0, var_1_45=0, var_1_47=0, var_1_5=32, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 230 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.0s, OverallIterations: 23, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9466 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9411 mSDsluCounter, 13816 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9472 mSDsCounter, 2246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8391 IncrementalHoareTripleChecker+Invalid, 10637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2246 mSolverCounterUnsat, 4344 mSDtfsCounter, 8391 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2566 GetRequests, 2313 SyntacticMatches, 2 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23648occurred in iteration=22, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 19892 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 6844 NumberOfCodeBlocks, 6844 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 7028 ConstructedInterpolants, 0 QuantifiedInterpolants, 34823 SizeOfPredicates, 21 NumberOfNonLiveVariables, 3040 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 31 InterpolantComputations, 18 PerfectInterpolantSequences, 68316/69564 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:37:39,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.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 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:37:41,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:37:41,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:37:41,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:37:41,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:37:41,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:37:41,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:37:41,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:37:41,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:37:41,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:37:41,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:37:41,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:37:41,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:37:41,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:37:41,516 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:37:41,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:37:41,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:37:41,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:37:41,517 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:37:41,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:37:41,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:37:41,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:37:41,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:37:41,520 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 -> 81f9c885cba2dee1faa6ea50c6c887a8afbb04e68b15a3a5c9caa87415ef3349 [2025-03-08 12:37:41,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:37:41,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:37:41,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:37:41,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:37:41,793 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:37:41,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-03-08 12:37:43,008 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8cd22b8/bd8e6ddd9b204a6bb4390bbb2cd2af4a/FLAG4a94a13cb [2025-03-08 12:37:43,189 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:37:43,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i [2025-03-08 12:37:43,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8cd22b8/bd8e6ddd9b204a6bb4390bbb2cd2af4a/FLAG4a94a13cb [2025-03-08 12:37:43,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8cd22b8/bd8e6ddd9b204a6bb4390bbb2cd2af4a [2025-03-08 12:37:43,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:37:43,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:37:43,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:37:43,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:37:43,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:37:43,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33366d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43, skipping insertion in model container [2025-03-08 12:37:43,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:37:43,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i[918,931] [2025-03-08 12:37:43,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:37:43,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:37:43,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-3.i[918,931] [2025-03-08 12:37:43,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:37:43,802 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:37:43,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43 WrapperNode [2025-03-08 12:37:43,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:37:43,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:37:43,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:37:43,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:37:43,809 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:37:43" (1/1) ... [2025-03-08 12:37:43,821 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:37:43" (1/1) ... [2025-03-08 12:37:43,853 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2025-03-08 12:37:43,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:37:43,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:37:43,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:37:43,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:37:43,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,884 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:37:43,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:37:43,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:37:43,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:37:43,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:37:43,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:43" (1/1) ... [2025-03-08 12:37:43,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:37:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:43,944 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:37:43,949 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:37:43,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:37:43,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:37:43,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:37:43,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:37:43,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:37:43,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:37:44,039 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:37:44,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation