./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:12:53,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:12:53,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:12:53,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:12:53,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:12:53,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:12:53,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:12:53,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:12:53,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:12:53,737 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:12:53,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:12:53,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:12:53,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:12:53,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:12:53,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:12:53,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:53,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:12:53,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:12:53,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:12:53,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:12:53,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:12:53,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:12:53,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:12:53,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:12:53,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:12:53,740 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fbb35f76027517819b7c383b61e34fa76a9ce203f76a516ef6e2a6ae9cf5da8 [2025-02-08 00:12:53,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:12:53,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:12:53,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:12:53,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:12:53,945 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:12:53,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-02-08 00:12:55,194 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8eb30b7/dc8afc73e78a4db8a6c2d7a3c83386b1/FLAG3d0b4f109 [2025-02-08 00:12:55,497 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:12:55,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-02-08 00:12:55,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8eb30b7/dc8afc73e78a4db8a6c2d7a3c83386b1/FLAG3d0b4f109 [2025-02-08 00:12:55,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef8eb30b7/dc8afc73e78a4db8a6c2d7a3c83386b1 [2025-02-08 00:12:55,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:12:55,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:12:55,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:55,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:12:55,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:12:55,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:55" (1/1) ... [2025-02-08 00:12:55,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b533ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:55, skipping insertion in model container [2025-02-08 00:12:55,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:12:55" (1/1) ... [2025-02-08 00:12:55,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:12:55,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c[1258,1271] [2025-02-08 00:12:56,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:56,194 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:12:56,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p2.c[1258,1271] [2025-02-08 00:12:56,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:12:56,374 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:12:56,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56 WrapperNode [2025-02-08 00:12:56,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:12:56,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:56,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:12:56,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:12:56,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:56,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:56,833 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4637 [2025-02-08 00:12:56,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:12:56,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:12:56,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:12:56,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:12:56,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:56,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:56,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,091 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-02-08 00:12:57,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:12:57,287 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:12:57,287 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:12:57,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:12:57,288 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (1/1) ... [2025-02-08 00:12:57,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:12:57,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:12:57,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:12:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:12:57,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:12:57,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:12:57,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:12:57,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:12:57,656 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:12:57,658 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:13:01,070 INFO L? ?]: Removed 2909 outVars from TransFormulas that were not future-live. [2025-02-08 00:13:01,071 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:13:01,199 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:13:01,200 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:13:01,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:01 BoogieIcfgContainer [2025-02-08 00:13:01,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:13:01,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:13:01,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:13:01,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:13:01,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:12:55" (1/3) ... [2025-02-08 00:13:01,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fbeccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:01, skipping insertion in model container [2025-02-08 00:13:01,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:12:56" (2/3) ... [2025-02-08 00:13:01,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fbeccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:01, skipping insertion in model container [2025-02-08 00:13:01,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:01" (3/3) ... [2025-02-08 00:13:01,208 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c [2025-02-08 00:13:01,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:13:01,223 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_bpbs_p2.c that has 1 procedures, 1152 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:13:01,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:13:01,308 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;@63be3999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:13:01,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:13:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 1152 states, 1150 states have (on average 1.5) internal successors, (1725), 1151 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-08 00:13:01,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:01,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:01,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:01,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 622899345, now seen corresponding path program 1 times [2025-02-08 00:13:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:01,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671329100] [2025-02-08 00:13:01,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:01,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:01,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 00:13:01,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 00:13:01,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:01,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671329100] [2025-02-08 00:13:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671329100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305546803] [2025-02-08 00:13:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:03,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:03,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:03,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:03,066 INFO L87 Difference]: Start difference. First operand has 1152 states, 1150 states have (on average 1.5) internal successors, (1725), 1151 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:03,835 INFO L93 Difference]: Finished difference Result 2169 states and 3250 transitions. [2025-02-08 00:13:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:03,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-08 00:13:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:03,850 INFO L225 Difference]: With dead ends: 2169 [2025-02-08 00:13:03,850 INFO L226 Difference]: Without dead ends: 1158 [2025-02-08 00:13:03,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:03,857 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 6 mSDsluCounter, 4285 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5716 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:03,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5716 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:13:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-08 00:13:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2025-02-08 00:13:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.4978354978354977) internal successors, (1730), 1155 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1730 transitions. [2025-02-08 00:13:03,922 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1730 transitions. Word has length 194 [2025-02-08 00:13:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:03,924 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1730 transitions. [2025-02-08 00:13:03,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1730 transitions. [2025-02-08 00:13:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 00:13:03,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:03,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:03,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:13:03,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:03,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:03,931 INFO L85 PathProgramCache]: Analyzing trace with hash -906399093, now seen corresponding path program 1 times [2025-02-08 00:13:03,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:03,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629121455] [2025-02-08 00:13:03,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:03,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 00:13:04,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 00:13:04,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:04,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:04,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629121455] [2025-02-08 00:13:04,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629121455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:04,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:04,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:04,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040355998] [2025-02-08 00:13:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:04,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:04,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:04,585 INFO L87 Difference]: Start difference. First operand 1156 states and 1730 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:05,017 INFO L93 Difference]: Finished difference Result 1160 states and 1734 transitions. [2025-02-08 00:13:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-08 00:13:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:05,021 INFO L225 Difference]: With dead ends: 1160 [2025-02-08 00:13:05,022 INFO L226 Difference]: Without dead ends: 1158 [2025-02-08 00:13:05,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:05,023 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:05,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4297 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-08 00:13:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2025-02-08 00:13:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.4969749351771824) internal successors, (1732), 1157 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1732 transitions. [2025-02-08 00:13:05,052 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1732 transitions. Word has length 195 [2025-02-08 00:13:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:05,052 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1732 transitions. [2025-02-08 00:13:05,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1732 transitions. [2025-02-08 00:13:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-08 00:13:05,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:05,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:13:05,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1971079669, now seen corresponding path program 1 times [2025-02-08 00:13:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857363853] [2025-02-08 00:13:05,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:05,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-08 00:13:05,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-08 00:13:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:05,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:05,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857363853] [2025-02-08 00:13:05,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857363853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:05,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:05,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579304629] [2025-02-08 00:13:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:05,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:05,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:05,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:05,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:05,432 INFO L87 Difference]: Start difference. First operand 1158 states and 1732 transitions. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:05,880 INFO L93 Difference]: Finished difference Result 2177 states and 3256 transitions. [2025-02-08 00:13:05,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2025-02-08 00:13:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:05,888 INFO L225 Difference]: With dead ends: 2177 [2025-02-08 00:13:05,888 INFO L226 Difference]: Without dead ends: 1160 [2025-02-08 00:13:05,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:05,891 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:05,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4294 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-02-08 00:13:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2025-02-08 00:13:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1159 states have (on average 1.4961173425366696) internal successors, (1734), 1159 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1734 transitions. [2025-02-08 00:13:05,912 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1734 transitions. Word has length 196 [2025-02-08 00:13:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:05,912 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1734 transitions. [2025-02-08 00:13:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1734 transitions. [2025-02-08 00:13:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-08 00:13:05,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:05,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:05,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:13:05,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:05,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1389529146, now seen corresponding path program 1 times [2025-02-08 00:13:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005879386] [2025-02-08 00:13:05,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:05,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-08 00:13:06,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 00:13:06,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:06,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005879386] [2025-02-08 00:13:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005879386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:06,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:06,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187033919] [2025-02-08 00:13:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:06,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:06,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:06,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:06,845 INFO L87 Difference]: Start difference. First operand 1160 states and 1734 transitions. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:07,541 INFO L93 Difference]: Finished difference Result 2187 states and 3269 transitions. [2025-02-08 00:13:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:07,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-02-08 00:13:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:07,546 INFO L225 Difference]: With dead ends: 2187 [2025-02-08 00:13:07,546 INFO L226 Difference]: Without dead ends: 1168 [2025-02-08 00:13:07,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:07,549 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 1646 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 5597 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:07,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 5597 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-02-08 00:13:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1165. [2025-02-08 00:13:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1164 states have (on average 1.4948453608247423) internal successors, (1740), 1164 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1740 transitions. [2025-02-08 00:13:07,576 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1740 transitions. Word has length 197 [2025-02-08 00:13:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:07,577 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1740 transitions. [2025-02-08 00:13:07,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1740 transitions. [2025-02-08 00:13:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-08 00:13:07,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:07,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:07,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:13:07,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 420532324, now seen corresponding path program 1 times [2025-02-08 00:13:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232404888] [2025-02-08 00:13:07,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:07,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 00:13:07,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 00:13:07,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:07,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:08,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:08,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232404888] [2025-02-08 00:13:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232404888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:08,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610996383] [2025-02-08 00:13:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:08,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:08,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:08,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:08,317 INFO L87 Difference]: Start difference. First operand 1165 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:08,903 INFO L93 Difference]: Finished difference Result 2195 states and 3278 transitions. [2025-02-08 00:13:08,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:08,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-02-08 00:13:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:08,907 INFO L225 Difference]: With dead ends: 2195 [2025-02-08 00:13:08,907 INFO L226 Difference]: Without dead ends: 1171 [2025-02-08 00:13:08,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:08,909 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 5 mSDsluCounter, 4285 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5716 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:08,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5716 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-02-08 00:13:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1169. [2025-02-08 00:13:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.4940068493150684) internal successors, (1745), 1168 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1745 transitions. [2025-02-08 00:13:08,931 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1745 transitions. Word has length 198 [2025-02-08 00:13:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:08,931 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1745 transitions. [2025-02-08 00:13:08,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1745 transitions. [2025-02-08 00:13:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-08 00:13:08,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:08,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:08,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:13:08,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash -711596183, now seen corresponding path program 1 times [2025-02-08 00:13:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107006278] [2025-02-08 00:13:08,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:08,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 00:13:09,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 00:13:09,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:09,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107006278] [2025-02-08 00:13:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107006278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:09,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:13:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538907005] [2025-02-08 00:13:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:09,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:13:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:09,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:13:09,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:09,526 INFO L87 Difference]: Start difference. First operand 1169 states and 1745 transitions. Second operand has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:10,205 INFO L93 Difference]: Finished difference Result 2236 states and 3336 transitions. [2025-02-08 00:13:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:13:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-02-08 00:13:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:10,209 INFO L225 Difference]: With dead ends: 2236 [2025-02-08 00:13:10,209 INFO L226 Difference]: Without dead ends: 1208 [2025-02-08 00:13:10,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:10,211 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 31 mSDsluCounter, 5765 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 7194 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:10,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 7194 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-02-08 00:13:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1204. [2025-02-08 00:13:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 1.4929343308395677) internal successors, (1796), 1203 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1796 transitions. [2025-02-08 00:13:10,233 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1796 transitions. Word has length 198 [2025-02-08 00:13:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:10,233 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1796 transitions. [2025-02-08 00:13:10,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.75) internal successors, (198), 8 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1796 transitions. [2025-02-08 00:13:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-08 00:13:10,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:10,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:10,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:13:10,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:10,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1424663283, now seen corresponding path program 1 times [2025-02-08 00:13:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801996352] [2025-02-08 00:13:10,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:10,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 00:13:10,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 00:13:10,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:10,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:10,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801996352] [2025-02-08 00:13:10,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801996352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:10,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:10,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:10,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066632660] [2025-02-08 00:13:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:10,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:10,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:10,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:10,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:10,537 INFO L87 Difference]: Start difference. First operand 1204 states and 1796 transitions. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:11,155 INFO L93 Difference]: Finished difference Result 2279 states and 3399 transitions. [2025-02-08 00:13:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-02-08 00:13:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:11,159 INFO L225 Difference]: With dead ends: 2279 [2025-02-08 00:13:11,160 INFO L226 Difference]: Without dead ends: 1216 [2025-02-08 00:13:11,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:11,162 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 4 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7150 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:11,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7150 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-02-08 00:13:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2025-02-08 00:13:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.491358024691358) internal successors, (1812), 1215 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1812 transitions. [2025-02-08 00:13:11,179 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1812 transitions. Word has length 198 [2025-02-08 00:13:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:11,180 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1812 transitions. [2025-02-08 00:13:11,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1812 transitions. [2025-02-08 00:13:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-08 00:13:11,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:11,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:11,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:13:11,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:11,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1769301663, now seen corresponding path program 1 times [2025-02-08 00:13:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645199601] [2025-02-08 00:13:11,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:11,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-08 00:13:11,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-08 00:13:11,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:11,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645199601] [2025-02-08 00:13:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645199601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:11,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:11,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:11,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189016690] [2025-02-08 00:13:11,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:11,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:11,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:11,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:11,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:11,490 INFO L87 Difference]: Start difference. First operand 1216 states and 1812 transitions. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:11,993 INFO L93 Difference]: Finished difference Result 2297 states and 3422 transitions. [2025-02-08 00:13:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:11,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-02-08 00:13:11,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:11,997 INFO L225 Difference]: With dead ends: 2297 [2025-02-08 00:13:11,998 INFO L226 Difference]: Without dead ends: 1222 [2025-02-08 00:13:11,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:12,000 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 4 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:12,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5722 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-02-08 00:13:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1222. [2025-02-08 00:13:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1221 states have (on average 1.4905814905814905) internal successors, (1820), 1221 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1820 transitions. [2025-02-08 00:13:12,017 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1820 transitions. Word has length 198 [2025-02-08 00:13:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1820 transitions. [2025-02-08 00:13:12,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1820 transitions. [2025-02-08 00:13:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-08 00:13:12,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:12,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:12,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:13:12,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1497118044, now seen corresponding path program 1 times [2025-02-08 00:13:12,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:12,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439002841] [2025-02-08 00:13:12,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:12,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:12,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 00:13:12,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 00:13:12,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439002841] [2025-02-08 00:13:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439002841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450049959] [2025-02-08 00:13:12,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:12,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:12,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:12,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:12,668 INFO L87 Difference]: Start difference. First operand 1222 states and 1820 transitions. Second operand has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:13,349 INFO L93 Difference]: Finished difference Result 2311 states and 3441 transitions. [2025-02-08 00:13:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-02-08 00:13:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:13,352 INFO L225 Difference]: With dead ends: 2311 [2025-02-08 00:13:13,353 INFO L226 Difference]: Without dead ends: 1230 [2025-02-08 00:13:13,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:13,356 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 1617 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 5597 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:13,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 5597 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2025-02-08 00:13:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2025-02-08 00:13:13,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1226 states have (on average 1.4893964110929854) internal successors, (1826), 1226 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1826 transitions. [2025-02-08 00:13:13,375 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1826 transitions. Word has length 199 [2025-02-08 00:13:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:13,376 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1826 transitions. [2025-02-08 00:13:13,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1826 transitions. [2025-02-08 00:13:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-08 00:13:13,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:13,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:13:13,378 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 743539782, now seen corresponding path program 1 times [2025-02-08 00:13:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477573641] [2025-02-08 00:13:13,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:13,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 00:13:13,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 00:13:13,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:13,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:13,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:13,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477573641] [2025-02-08 00:13:13,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477573641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:13,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:13,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:13:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535828836] [2025-02-08 00:13:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:13,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:13:13,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:13,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:13:13,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:13,814 INFO L87 Difference]: Start difference. First operand 1227 states and 1826 transitions. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:14,447 INFO L93 Difference]: Finished difference Result 2351 states and 3496 transitions. [2025-02-08 00:13:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:13:14,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-02-08 00:13:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:14,451 INFO L225 Difference]: With dead ends: 2351 [2025-02-08 00:13:14,451 INFO L226 Difference]: Without dead ends: 1265 [2025-02-08 00:13:14,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:14,453 INFO L435 NwaCegarLoop]: 1428 mSDtfsCounter, 31 mSDsluCounter, 5762 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 7190 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:14,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 7190 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-02-08 00:13:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1261. [2025-02-08 00:13:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 1.4880952380952381) internal successors, (1875), 1260 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1875 transitions. [2025-02-08 00:13:14,469 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1875 transitions. Word has length 200 [2025-02-08 00:13:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:14,469 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1875 transitions. [2025-02-08 00:13:14,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1875 transitions. [2025-02-08 00:13:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-08 00:13:14,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:14,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:14,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:13:14,471 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 952012459, now seen corresponding path program 1 times [2025-02-08 00:13:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346577949] [2025-02-08 00:13:14,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 00:13:14,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 00:13:14,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:14,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346577949] [2025-02-08 00:13:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346577949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:15,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:15,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455176139] [2025-02-08 00:13:15,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:15,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:15,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:15,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:15,434 INFO L87 Difference]: Start difference. First operand 1261 states and 1875 transitions. Second operand has 7 states, 7 states have (on average 28.571428571428573) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:16,031 INFO L93 Difference]: Finished difference Result 2389 states and 3551 transitions. [2025-02-08 00:13:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.571428571428573) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-02-08 00:13:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:16,034 INFO L225 Difference]: With dead ends: 2389 [2025-02-08 00:13:16,034 INFO L226 Difference]: Without dead ends: 1269 [2025-02-08 00:13:16,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:16,037 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 1596 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 5597 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:16,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 5597 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-02-08 00:13:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1266. [2025-02-08 00:13:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.4869565217391305) internal successors, (1881), 1265 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1881 transitions. [2025-02-08 00:13:16,051 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1881 transitions. Word has length 200 [2025-02-08 00:13:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:16,051 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1881 transitions. [2025-02-08 00:13:16,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.571428571428573) internal successors, (200), 6 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1881 transitions. [2025-02-08 00:13:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-08 00:13:16,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:16,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:16,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:13:16,053 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:16,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:16,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1887099556, now seen corresponding path program 1 times [2025-02-08 00:13:16,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:16,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085384309] [2025-02-08 00:13:16,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:16,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 00:13:16,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 00:13:16,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:16,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085384309] [2025-02-08 00:13:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085384309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:16,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081770849] [2025-02-08 00:13:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:16,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:16,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:16,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:16,584 INFO L87 Difference]: Start difference. First operand 1266 states and 1881 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:17,000 INFO L93 Difference]: Finished difference Result 2402 states and 3568 transitions. [2025-02-08 00:13:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:17,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-08 00:13:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:17,003 INFO L225 Difference]: With dead ends: 2402 [2025-02-08 00:13:17,003 INFO L226 Difference]: Without dead ends: 1277 [2025-02-08 00:13:17,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:17,004 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 5 mSDsluCounter, 4285 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5716 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:17,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5716 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-02-08 00:13:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1274. [2025-02-08 00:13:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 1.485467399842891) internal successors, (1891), 1273 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1891 transitions. [2025-02-08 00:13:17,018 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1891 transitions. Word has length 201 [2025-02-08 00:13:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:17,018 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1891 transitions. [2025-02-08 00:13:17,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1891 transitions. [2025-02-08 00:13:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-08 00:13:17,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:17,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:17,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:13:17,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:17,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1800289065, now seen corresponding path program 1 times [2025-02-08 00:13:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804082398] [2025-02-08 00:13:17,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:17,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 00:13:17,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 00:13:17,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:17,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:17,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:17,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804082398] [2025-02-08 00:13:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804082398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:17,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:17,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565392143] [2025-02-08 00:13:17,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:17,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:17,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:17,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:17,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:17,487 INFO L87 Difference]: Start difference. First operand 1274 states and 1891 transitions. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:18,085 INFO L93 Difference]: Finished difference Result 2419 states and 3589 transitions. [2025-02-08 00:13:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:18,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-08 00:13:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:18,089 INFO L225 Difference]: With dead ends: 2419 [2025-02-08 00:13:18,090 INFO L226 Difference]: Without dead ends: 1286 [2025-02-08 00:13:18,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:18,092 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 4 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7150 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:18,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7150 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-02-08 00:13:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1286. [2025-02-08 00:13:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 1.484046692607004) internal successors, (1907), 1285 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1907 transitions. [2025-02-08 00:13:18,106 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1907 transitions. Word has length 201 [2025-02-08 00:13:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:18,106 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1907 transitions. [2025-02-08 00:13:18,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1907 transitions. [2025-02-08 00:13:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-08 00:13:18,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:18,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:18,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:13:18,108 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:18,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash 43812693, now seen corresponding path program 1 times [2025-02-08 00:13:18,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:18,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528242146] [2025-02-08 00:13:18,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:18,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:18,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 00:13:18,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 00:13:18,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:18,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:18,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:18,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528242146] [2025-02-08 00:13:18,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528242146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:18,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:18,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:18,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975066690] [2025-02-08 00:13:18,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:18,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:18,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:18,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:18,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:18,601 INFO L87 Difference]: Start difference. First operand 1286 states and 1907 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:19,079 INFO L93 Difference]: Finished difference Result 2441 states and 3617 transitions. [2025-02-08 00:13:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:19,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-08 00:13:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:19,083 INFO L225 Difference]: With dead ends: 2441 [2025-02-08 00:13:19,083 INFO L226 Difference]: Without dead ends: 1296 [2025-02-08 00:13:19,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:19,084 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 1624 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:19,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 4197 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-02-08 00:13:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-02-08 00:13:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 1.481853281853282) internal successors, (1919), 1295 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1919 transitions. [2025-02-08 00:13:19,097 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1919 transitions. Word has length 201 [2025-02-08 00:13:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:19,097 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1919 transitions. [2025-02-08 00:13:19,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1919 transitions. [2025-02-08 00:13:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-08 00:13:19,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:19,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:13:19,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:19,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1908164100, now seen corresponding path program 1 times [2025-02-08 00:13:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035621364] [2025-02-08 00:13:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:19,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 00:13:19,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 00:13:19,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:19,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035621364] [2025-02-08 00:13:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035621364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:19,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374448505] [2025-02-08 00:13:19,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:19,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:19,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:19,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:19,312 INFO L87 Difference]: Start difference. First operand 1296 states and 1919 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:19,654 INFO L93 Difference]: Finished difference Result 2455 states and 3633 transitions. [2025-02-08 00:13:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-08 00:13:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:19,659 INFO L225 Difference]: With dead ends: 2455 [2025-02-08 00:13:19,659 INFO L226 Difference]: Without dead ends: 1300 [2025-02-08 00:13:19,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:19,660 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:19,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4294 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:13:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-02-08 00:13:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-02-08 00:13:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 1.4803695150115475) internal successors, (1923), 1299 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1923 transitions. [2025-02-08 00:13:19,675 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1923 transitions. Word has length 201 [2025-02-08 00:13:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:19,676 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1923 transitions. [2025-02-08 00:13:19,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1923 transitions. [2025-02-08 00:13:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-08 00:13:19,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:19,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:13:19,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 603618029, now seen corresponding path program 1 times [2025-02-08 00:13:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334160949] [2025-02-08 00:13:19,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:19,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 00:13:19,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 00:13:19,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:19,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:19,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334160949] [2025-02-08 00:13:19,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334160949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:19,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76544945] [2025-02-08 00:13:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:19,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:19,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:19,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:19,947 INFO L87 Difference]: Start difference. First operand 1300 states and 1923 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:20,361 INFO L93 Difference]: Finished difference Result 2461 states and 3638 transitions. [2025-02-08 00:13:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:20,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-08 00:13:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:20,364 INFO L225 Difference]: With dead ends: 2461 [2025-02-08 00:13:20,364 INFO L226 Difference]: Without dead ends: 1302 [2025-02-08 00:13:20,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:20,366 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:20,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4294 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-02-08 00:13:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2025-02-08 00:13:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1301 states have (on average 1.479631053036126) internal successors, (1925), 1301 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1925 transitions. [2025-02-08 00:13:20,377 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1925 transitions. Word has length 201 [2025-02-08 00:13:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:20,378 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1925 transitions. [2025-02-08 00:13:20,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1925 transitions. [2025-02-08 00:13:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-08 00:13:20,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:20,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:20,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:13:20,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:20,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:20,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1624359573, now seen corresponding path program 1 times [2025-02-08 00:13:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:20,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782622446] [2025-02-08 00:13:20,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:20,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 00:13:20,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 00:13:20,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:20,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:20,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782622446] [2025-02-08 00:13:20,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782622446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:20,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146280020] [2025-02-08 00:13:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:20,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:20,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:20,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:20,807 INFO L87 Difference]: Start difference. First operand 1302 states and 1925 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:21,342 INFO L93 Difference]: Finished difference Result 2469 states and 3648 transitions. [2025-02-08 00:13:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-02-08 00:13:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:21,345 INFO L225 Difference]: With dead ends: 2469 [2025-02-08 00:13:21,345 INFO L226 Difference]: Without dead ends: 1308 [2025-02-08 00:13:21,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:21,346 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 5 mSDsluCounter, 4285 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5716 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:21,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5716 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-02-08 00:13:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1306. [2025-02-08 00:13:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1305 states have (on average 1.4789272030651341) internal successors, (1930), 1305 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1930 transitions. [2025-02-08 00:13:21,356 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1930 transitions. Word has length 202 [2025-02-08 00:13:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:21,357 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1930 transitions. [2025-02-08 00:13:21,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1930 transitions. [2025-02-08 00:13:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-08 00:13:21,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:21,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:21,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:13:21,359 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:21,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1101149946, now seen corresponding path program 1 times [2025-02-08 00:13:21,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399260766] [2025-02-08 00:13:21,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:21,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:21,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 00:13:21,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 00:13:21,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:21,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:21,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:21,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399260766] [2025-02-08 00:13:21,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399260766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:21,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:21,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:21,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425527699] [2025-02-08 00:13:21,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:21,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:21,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:21,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:21,777 INFO L87 Difference]: Start difference. First operand 1306 states and 1930 transitions. Second operand has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:22,953 INFO L93 Difference]: Finished difference Result 3017 states and 4439 transitions. [2025-02-08 00:13:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-02-08 00:13:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:22,959 INFO L225 Difference]: With dead ends: 3017 [2025-02-08 00:13:22,959 INFO L226 Difference]: Without dead ends: 1852 [2025-02-08 00:13:22,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:22,961 INFO L435 NwaCegarLoop]: 1166 mSDtfsCounter, 2725 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 4655 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:22,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 4655 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:13:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-02-08 00:13:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1461. [2025-02-08 00:13:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.4787671232876711) internal successors, (2159), 1460 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2159 transitions. [2025-02-08 00:13:22,989 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2159 transitions. Word has length 202 [2025-02-08 00:13:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:22,990 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2159 transitions. [2025-02-08 00:13:22,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2159 transitions. [2025-02-08 00:13:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-08 00:13:22,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:22,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:22,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:13:22,992 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:22,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash 238908405, now seen corresponding path program 1 times [2025-02-08 00:13:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793045793] [2025-02-08 00:13:22,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:23,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 00:13:23,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 00:13:23,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:23,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:23,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:23,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793045793] [2025-02-08 00:13:23,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793045793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:23,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:23,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:23,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637829391] [2025-02-08 00:13:23,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:23,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:23,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:23,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:23,698 INFO L87 Difference]: Start difference. First operand 1461 states and 2159 transitions. Second operand has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:24,748 INFO L93 Difference]: Finished difference Result 3017 states and 4437 transitions. [2025-02-08 00:13:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-02-08 00:13:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:24,756 INFO L225 Difference]: With dead ends: 3017 [2025-02-08 00:13:24,756 INFO L226 Difference]: Without dead ends: 1852 [2025-02-08 00:13:24,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:24,757 INFO L435 NwaCegarLoop]: 1166 mSDtfsCounter, 2203 mSDsluCounter, 3488 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 4654 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:24,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2203 Valid, 4654 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:13:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-02-08 00:13:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1540. [2025-02-08 00:13:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.4736842105263157) internal successors, (2268), 1539 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2268 transitions. [2025-02-08 00:13:24,770 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2268 transitions. Word has length 202 [2025-02-08 00:13:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:24,770 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2268 transitions. [2025-02-08 00:13:24,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.666666666666664) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2268 transitions. [2025-02-08 00:13:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-08 00:13:24,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:24,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:24,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:13:24,773 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash 531444124, now seen corresponding path program 1 times [2025-02-08 00:13:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187556065] [2025-02-08 00:13:24,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:24,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-08 00:13:24,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-08 00:13:24,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:24,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187556065] [2025-02-08 00:13:25,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187556065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:25,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:25,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216523613] [2025-02-08 00:13:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:25,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:25,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:25,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:25,492 INFO L87 Difference]: Start difference. First operand 1540 states and 2268 transitions. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:26,193 INFO L93 Difference]: Finished difference Result 2712 states and 3998 transitions. [2025-02-08 00:13:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:26,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-02-08 00:13:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:26,197 INFO L225 Difference]: With dead ends: 2712 [2025-02-08 00:13:26,197 INFO L226 Difference]: Without dead ends: 1547 [2025-02-08 00:13:26,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:26,202 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1538 mSDsluCounter, 5581 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 6979 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:26,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 6979 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:13:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-02-08 00:13:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1546. [2025-02-08 00:13:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 1.4724919093851132) internal successors, (2275), 1545 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2275 transitions. [2025-02-08 00:13:26,219 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2275 transitions. Word has length 202 [2025-02-08 00:13:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:26,219 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2275 transitions. [2025-02-08 00:13:26,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2275 transitions. [2025-02-08 00:13:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 00:13:26,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:26,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:26,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:13:26,221 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:26,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1183262500, now seen corresponding path program 1 times [2025-02-08 00:13:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531806425] [2025-02-08 00:13:26,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:26,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 00:13:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 00:13:26,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:27,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531806425] [2025-02-08 00:13:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531806425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:27,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:27,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708736614] [2025-02-08 00:13:27,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:27,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:27,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:27,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:27,139 INFO L87 Difference]: Start difference. First operand 1546 states and 2275 transitions. Second operand has 7 states, 7 states have (on average 29.0) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:27,984 INFO L93 Difference]: Finished difference Result 2721 states and 4007 transitions. [2025-02-08 00:13:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:27,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 00:13:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:27,988 INFO L225 Difference]: With dead ends: 2721 [2025-02-08 00:13:27,988 INFO L226 Difference]: Without dead ends: 1550 [2025-02-08 00:13:27,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:27,990 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 1744 mSDsluCounter, 5325 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 6725 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:27,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 6725 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:13:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2025-02-08 00:13:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1546. [2025-02-08 00:13:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 1.4724919093851132) internal successors, (2275), 1545 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2275 transitions. [2025-02-08 00:13:28,003 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2275 transitions. Word has length 203 [2025-02-08 00:13:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:28,004 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2275 transitions. [2025-02-08 00:13:28,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.0) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2275 transitions. [2025-02-08 00:13:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 00:13:28,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:28,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:13:28,006 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1670823067, now seen corresponding path program 1 times [2025-02-08 00:13:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070068281] [2025-02-08 00:13:28,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:28,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 00:13:28,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 00:13:28,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:28,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070068281] [2025-02-08 00:13:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070068281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:29,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:29,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 00:13:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629863127] [2025-02-08 00:13:29,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:29,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 00:13:29,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:29,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 00:13:29,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:13:29,081 INFO L87 Difference]: Start difference. First operand 1546 states and 2275 transitions. Second operand has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 12 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:30,251 INFO L93 Difference]: Finished difference Result 2810 states and 4131 transitions. [2025-02-08 00:13:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:13:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 12 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 00:13:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:30,257 INFO L225 Difference]: With dead ends: 2810 [2025-02-08 00:13:30,257 INFO L226 Difference]: Without dead ends: 1639 [2025-02-08 00:13:30,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:13:30,262 INFO L435 NwaCegarLoop]: 1424 mSDtfsCounter, 43 mSDsluCounter, 12829 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 14253 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:30,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 14253 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:13:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2025-02-08 00:13:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1616. [2025-02-08 00:13:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 1.4693498452012383) internal successors, (2373), 1615 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2373 transitions. [2025-02-08 00:13:30,276 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2373 transitions. Word has length 203 [2025-02-08 00:13:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:30,276 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2373 transitions. [2025-02-08 00:13:30,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 12 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2373 transitions. [2025-02-08 00:13:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 00:13:30,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:30,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:30,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:13:30,279 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash 71691006, now seen corresponding path program 1 times [2025-02-08 00:13:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:30,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579754991] [2025-02-08 00:13:30,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:30,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:30,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 00:13:30,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 00:13:30,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:30,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579754991] [2025-02-08 00:13:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579754991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:30,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:30,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:13:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388951120] [2025-02-08 00:13:30,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:30,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:13:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:30,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:13:30,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:30,785 INFO L87 Difference]: Start difference. First operand 1616 states and 2373 transitions. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:31,587 INFO L93 Difference]: Finished difference Result 2869 states and 4214 transitions. [2025-02-08 00:13:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:13:31,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 00:13:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:31,591 INFO L225 Difference]: With dead ends: 2869 [2025-02-08 00:13:31,591 INFO L226 Difference]: Without dead ends: 1658 [2025-02-08 00:13:31,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:31,592 INFO L435 NwaCegarLoop]: 1428 mSDtfsCounter, 30 mSDsluCounter, 8549 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 9977 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:31,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 9977 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:13:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-02-08 00:13:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1654. [2025-02-08 00:13:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.4682395644283122) internal successors, (2427), 1653 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2427 transitions. [2025-02-08 00:13:31,609 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2427 transitions. Word has length 203 [2025-02-08 00:13:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:31,609 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2427 transitions. [2025-02-08 00:13:31,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2427 transitions. [2025-02-08 00:13:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 00:13:31,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:31,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:31,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:13:31,611 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:31,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 530380980, now seen corresponding path program 1 times [2025-02-08 00:13:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:31,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846468940] [2025-02-08 00:13:31,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:31,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 00:13:31,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 00:13:31,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:31,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846468940] [2025-02-08 00:13:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846468940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:31,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092073247] [2025-02-08 00:13:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:31,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:31,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:31,910 INFO L87 Difference]: Start difference. First operand 1654 states and 2427 transitions. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:32,510 INFO L93 Difference]: Finished difference Result 2915 states and 4280 transitions. [2025-02-08 00:13:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:32,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 00:13:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:32,513 INFO L225 Difference]: With dead ends: 2915 [2025-02-08 00:13:32,513 INFO L226 Difference]: Without dead ends: 1666 [2025-02-08 00:13:32,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:32,516 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 4 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:32,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5722 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-02-08 00:13:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2025-02-08 00:13:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.4672672672672673) internal successors, (2443), 1665 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2443 transitions. [2025-02-08 00:13:32,529 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2443 transitions. Word has length 203 [2025-02-08 00:13:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:32,529 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2443 transitions. [2025-02-08 00:13:32,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2443 transitions. [2025-02-08 00:13:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 00:13:32,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:32,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:32,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 00:13:32,531 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:32,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:32,532 INFO L85 PathProgramCache]: Analyzing trace with hash -62924839, now seen corresponding path program 1 times [2025-02-08 00:13:32,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:32,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574969557] [2025-02-08 00:13:32,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:32,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:32,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 00:13:32,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 00:13:32,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:32,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574969557] [2025-02-08 00:13:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574969557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736533842] [2025-02-08 00:13:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:32,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:32,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:32,753 INFO L87 Difference]: Start difference. First operand 1666 states and 2443 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:33,128 INFO L93 Difference]: Finished difference Result 2931 states and 4300 transitions. [2025-02-08 00:13:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:33,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 00:13:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:33,131 INFO L225 Difference]: With dead ends: 2931 [2025-02-08 00:13:33,131 INFO L226 Difference]: Without dead ends: 1670 [2025-02-08 00:13:33,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:33,132 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:33,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4294 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-02-08 00:13:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2025-02-08 00:13:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1669 states have (on average 1.4661473936488916) internal successors, (2447), 1669 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2447 transitions. [2025-02-08 00:13:33,144 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2447 transitions. Word has length 203 [2025-02-08 00:13:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:33,144 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2447 transitions. [2025-02-08 00:13:33,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2447 transitions. [2025-02-08 00:13:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 00:13:33,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:33,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:33,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 00:13:33,146 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:33,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1942942255, now seen corresponding path program 1 times [2025-02-08 00:13:33,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:33,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477367636] [2025-02-08 00:13:33,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:33,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:33,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 00:13:33,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 00:13:33,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:33,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:33,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:33,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477367636] [2025-02-08 00:13:33,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477367636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:33,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:33,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684100079] [2025-02-08 00:13:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:33,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:33,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:33,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:33,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:33,387 INFO L87 Difference]: Start difference. First operand 1670 states and 2447 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:33,766 INFO L93 Difference]: Finished difference Result 3020 states and 4424 transitions. [2025-02-08 00:13:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:33,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 00:13:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:33,768 INFO L225 Difference]: With dead ends: 3020 [2025-02-08 00:13:33,768 INFO L226 Difference]: Without dead ends: 1682 [2025-02-08 00:13:33,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:33,770 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:33,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4294 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-02-08 00:13:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2025-02-08 00:13:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 1.462819750148721) internal successors, (2459), 1681 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2459 transitions. [2025-02-08 00:13:33,782 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2459 transitions. Word has length 203 [2025-02-08 00:13:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:33,783 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2459 transitions. [2025-02-08 00:13:33,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2459 transitions. [2025-02-08 00:13:33,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-08 00:13:33,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:33,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:33,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 00:13:33,784 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:33,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:33,785 INFO L85 PathProgramCache]: Analyzing trace with hash -941653713, now seen corresponding path program 1 times [2025-02-08 00:13:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:33,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618423442] [2025-02-08 00:13:33,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:33,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-08 00:13:33,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-08 00:13:33,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:33,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618423442] [2025-02-08 00:13:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618423442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:34,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492663886] [2025-02-08 00:13:34,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:34,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:34,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:34,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:34,044 INFO L87 Difference]: Start difference. First operand 1682 states and 2459 transitions. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:34,543 INFO L93 Difference]: Finished difference Result 3098 states and 4521 transitions. [2025-02-08 00:13:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-08 00:13:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:34,546 INFO L225 Difference]: With dead ends: 3098 [2025-02-08 00:13:34,546 INFO L226 Difference]: Without dead ends: 1686 [2025-02-08 00:13:34,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:34,549 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5723 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:34,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5723 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-02-08 00:13:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2025-02-08 00:13:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 1.461721068249258) internal successors, (2463), 1685 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2463 transitions. [2025-02-08 00:13:34,562 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2463 transitions. Word has length 203 [2025-02-08 00:13:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:34,563 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2463 transitions. [2025-02-08 00:13:34,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2463 transitions. [2025-02-08 00:13:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 00:13:34,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:34,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:34,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 00:13:34,564 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:34,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash -355646028, now seen corresponding path program 1 times [2025-02-08 00:13:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503126346] [2025-02-08 00:13:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:34,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 00:13:34,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 00:13:34,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:34,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:35,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503126346] [2025-02-08 00:13:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503126346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:35,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:35,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559137472] [2025-02-08 00:13:35,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:35,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:35,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:35,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:35,025 INFO L87 Difference]: Start difference. First operand 1686 states and 2463 transitions. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:35,639 INFO L93 Difference]: Finished difference Result 3777 states and 5484 transitions. [2025-02-08 00:13:35,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:35,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-08 00:13:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:35,642 INFO L225 Difference]: With dead ends: 3777 [2025-02-08 00:13:35,642 INFO L226 Difference]: Without dead ends: 2357 [2025-02-08 00:13:35,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:35,643 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2022 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:35,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 5631 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2025-02-08 00:13:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1948. [2025-02-08 00:13:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1947 states have (on average 1.465331278890601) internal successors, (2853), 1947 states have internal predecessors, (2853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2853 transitions. [2025-02-08 00:13:35,663 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2853 transitions. Word has length 204 [2025-02-08 00:13:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:35,663 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2853 transitions. [2025-02-08 00:13:35,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2853 transitions. [2025-02-08 00:13:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 00:13:35,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:35,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:35,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 00:13:35,668 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:35,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1200189900, now seen corresponding path program 1 times [2025-02-08 00:13:35,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:35,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077997032] [2025-02-08 00:13:35,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:35,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:35,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 00:13:35,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 00:13:35,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:35,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:36,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:36,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077997032] [2025-02-08 00:13:36,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077997032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:36,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:36,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862372199] [2025-02-08 00:13:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:36,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:36,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:36,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:36,160 INFO L87 Difference]: Start difference. First operand 1948 states and 2853 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:36,722 INFO L93 Difference]: Finished difference Result 3710 states and 5403 transitions. [2025-02-08 00:13:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-08 00:13:36,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:36,726 INFO L225 Difference]: With dead ends: 3710 [2025-02-08 00:13:36,726 INFO L226 Difference]: Without dead ends: 2323 [2025-02-08 00:13:36,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:36,728 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 505 mSDsluCounter, 4278 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 5708 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:36,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 5708 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2025-02-08 00:13:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1941. [2025-02-08 00:13:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1940 states have (on average 1.465463917525773) internal successors, (2843), 1940 states have internal predecessors, (2843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2843 transitions. [2025-02-08 00:13:36,747 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2843 transitions. Word has length 204 [2025-02-08 00:13:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:36,747 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2843 transitions. [2025-02-08 00:13:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2843 transitions. [2025-02-08 00:13:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 00:13:36,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:36,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:36,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 00:13:36,750 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:36,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:36,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1934375409, now seen corresponding path program 1 times [2025-02-08 00:13:36,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:36,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918532570] [2025-02-08 00:13:36,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:36,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 00:13:36,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 00:13:36,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:36,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918532570] [2025-02-08 00:13:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918532570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844570363] [2025-02-08 00:13:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:37,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:37,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:37,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:37,324 INFO L87 Difference]: Start difference. First operand 1941 states and 2843 transitions. Second operand has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:38,066 INFO L93 Difference]: Finished difference Result 4198 states and 6112 transitions. [2025-02-08 00:13:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:38,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-08 00:13:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:38,071 INFO L225 Difference]: With dead ends: 4198 [2025-02-08 00:13:38,071 INFO L226 Difference]: Without dead ends: 2834 [2025-02-08 00:13:38,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:38,073 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2013 mSDsluCounter, 5626 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2013 SdHoareTripleChecker+Valid, 7036 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:38,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2013 Valid, 7036 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:13:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2025-02-08 00:13:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2514. [2025-02-08 00:13:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 2513 states have (on average 1.464783127735774) internal successors, (3681), 2513 states have internal predecessors, (3681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3681 transitions. [2025-02-08 00:13:38,104 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3681 transitions. Word has length 204 [2025-02-08 00:13:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:38,105 INFO L471 AbstractCegarLoop]: Abstraction has 2514 states and 3681 transitions. [2025-02-08 00:13:38,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3681 transitions. [2025-02-08 00:13:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 00:13:38,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:38,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:38,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 00:13:38,107 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:38,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1299669219, now seen corresponding path program 1 times [2025-02-08 00:13:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955009371] [2025-02-08 00:13:38,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:38,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 00:13:38,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 00:13:38,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:38,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:38,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:38,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955009371] [2025-02-08 00:13:38,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955009371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:38,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:38,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613596911] [2025-02-08 00:13:38,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:38,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:38,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:38,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:38,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:38,528 INFO L87 Difference]: Start difference. First operand 2514 states and 3681 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:39,047 INFO L93 Difference]: Finished difference Result 4150 states and 6058 transitions. [2025-02-08 00:13:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:39,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-08 00:13:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:39,051 INFO L225 Difference]: With dead ends: 4150 [2025-02-08 00:13:39,051 INFO L226 Difference]: Without dead ends: 2872 [2025-02-08 00:13:39,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:39,052 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 485 mSDsluCounter, 4281 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 5713 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:39,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 5713 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2025-02-08 00:13:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2509. [2025-02-08 00:13:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 2508 states have (on average 1.4637161084529506) internal successors, (3671), 2508 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3671 transitions. [2025-02-08 00:13:39,069 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3671 transitions. Word has length 204 [2025-02-08 00:13:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:39,069 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 3671 transitions. [2025-02-08 00:13:39,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3671 transitions. [2025-02-08 00:13:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 00:13:39,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:39,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:39,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 00:13:39,071 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:39,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1215540084, now seen corresponding path program 1 times [2025-02-08 00:13:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908088221] [2025-02-08 00:13:39,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:39,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 00:13:39,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 00:13:39,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:39,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:39,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908088221] [2025-02-08 00:13:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908088221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:39,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:39,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:39,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320190109] [2025-02-08 00:13:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:39,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:39,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:39,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:39,296 INFO L87 Difference]: Start difference. First operand 2509 states and 3671 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:39,679 INFO L93 Difference]: Finished difference Result 3786 states and 5540 transitions. [2025-02-08 00:13:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-08 00:13:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:39,683 INFO L225 Difference]: With dead ends: 3786 [2025-02-08 00:13:39,683 INFO L226 Difference]: Without dead ends: 2513 [2025-02-08 00:13:39,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:39,685 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:39,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4294 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-08 00:13:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2513. [2025-02-08 00:13:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2512 states have (on average 1.4629777070063694) internal successors, (3675), 2512 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3675 transitions. [2025-02-08 00:13:39,707 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3675 transitions. Word has length 204 [2025-02-08 00:13:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:39,707 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 3675 transitions. [2025-02-08 00:13:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3675 transitions. [2025-02-08 00:13:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 00:13:39,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:39,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:39,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 00:13:39,710 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 789494439, now seen corresponding path program 1 times [2025-02-08 00:13:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:39,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406047452] [2025-02-08 00:13:39,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:39,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 00:13:39,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 00:13:39,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:39,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406047452] [2025-02-08 00:13:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406047452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:13:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642397621] [2025-02-08 00:13:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:13:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:40,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:13:40,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:40,547 INFO L87 Difference]: Start difference. First operand 2513 states and 3675 transitions. Second operand has 8 states, 8 states have (on average 25.5) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:41,337 INFO L93 Difference]: Finished difference Result 5512 states and 8036 transitions. [2025-02-08 00:13:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:13:41,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-08 00:13:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:41,342 INFO L225 Difference]: With dead ends: 5512 [2025-02-08 00:13:41,342 INFO L226 Difference]: Without dead ends: 4235 [2025-02-08 00:13:41,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:13:41,343 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 2556 mSDsluCounter, 7030 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 8439 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:41,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 8439 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:13:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2025-02-08 00:13:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4231. [2025-02-08 00:13:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4231 states, 4230 states have (on average 1.4569739952718677) internal successors, (6163), 4230 states have internal predecessors, (6163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4231 states to 4231 states and 6163 transitions. [2025-02-08 00:13:41,370 INFO L78 Accepts]: Start accepts. Automaton has 4231 states and 6163 transitions. Word has length 204 [2025-02-08 00:13:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:41,370 INFO L471 AbstractCegarLoop]: Abstraction has 4231 states and 6163 transitions. [2025-02-08 00:13:41,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.5) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4231 states and 6163 transitions. [2025-02-08 00:13:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 00:13:41,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:41,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:41,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 00:13:41,374 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:41,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash 834292555, now seen corresponding path program 1 times [2025-02-08 00:13:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:41,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199296507] [2025-02-08 00:13:41,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:41,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 00:13:41,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 00:13:41,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:41,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199296507] [2025-02-08 00:13:41,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199296507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:41,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:41,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592646989] [2025-02-08 00:13:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:41,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:41,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:41,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:41,628 INFO L87 Difference]: Start difference. First operand 4231 states and 6163 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:42,087 INFO L93 Difference]: Finished difference Result 5552 states and 8096 transitions. [2025-02-08 00:13:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-08 00:13:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:42,091 INFO L225 Difference]: With dead ends: 5552 [2025-02-08 00:13:42,091 INFO L226 Difference]: Without dead ends: 4275 [2025-02-08 00:13:42,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:42,093 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 20 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:42,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5722 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-02-08 00:13:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4275. [2025-02-08 00:13:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.4569489939167057) internal successors, (6227), 4274 states have internal predecessors, (6227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6227 transitions. [2025-02-08 00:13:42,124 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6227 transitions. Word has length 204 [2025-02-08 00:13:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:42,124 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 6227 transitions. [2025-02-08 00:13:42,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6227 transitions. [2025-02-08 00:13:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-08 00:13:42,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:42,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:42,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 00:13:42,128 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:42,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash 74212572, now seen corresponding path program 1 times [2025-02-08 00:13:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:42,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850210175] [2025-02-08 00:13:42,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:42,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 00:13:42,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 00:13:42,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:42,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850210175] [2025-02-08 00:13:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850210175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440428328] [2025-02-08 00:13:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:42,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:42,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:42,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:42,375 INFO L87 Difference]: Start difference. First operand 4275 states and 6227 transitions. Second operand has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:42,876 INFO L93 Difference]: Finished difference Result 5644 states and 8230 transitions. [2025-02-08 00:13:42,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-02-08 00:13:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:42,879 INFO L225 Difference]: With dead ends: 5644 [2025-02-08 00:13:42,879 INFO L226 Difference]: Without dead ends: 4319 [2025-02-08 00:13:42,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:42,880 INFO L435 NwaCegarLoop]: 1433 mSDtfsCounter, 20 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:42,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5722 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2025-02-08 00:13:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 4319. [2025-02-08 00:13:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4319 states, 4318 states have (on average 1.4569245020842982) internal successors, (6291), 4318 states have internal predecessors, (6291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 6291 transitions. [2025-02-08 00:13:42,908 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 6291 transitions. Word has length 205 [2025-02-08 00:13:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:42,908 INFO L471 AbstractCegarLoop]: Abstraction has 4319 states and 6291 transitions. [2025-02-08 00:13:42,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 6291 transitions. [2025-02-08 00:13:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-08 00:13:42,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:42,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:42,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 00:13:42,912 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:42,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash 316108763, now seen corresponding path program 1 times [2025-02-08 00:13:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:42,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604046386] [2025-02-08 00:13:42,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:42,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 00:13:43,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 00:13:43,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:43,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:43,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604046386] [2025-02-08 00:13:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604046386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:43,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:43,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:13:43,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825169278] [2025-02-08 00:13:43,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:43,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:13:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:43,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:13:43,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:13:43,988 INFO L87 Difference]: Start difference. First operand 4319 states and 6291 transitions. Second operand has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:45,117 INFO L93 Difference]: Finished difference Result 6845 states and 9934 transitions. [2025-02-08 00:13:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:13:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-02-08 00:13:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:45,121 INFO L225 Difference]: With dead ends: 6845 [2025-02-08 00:13:45,121 INFO L226 Difference]: Without dead ends: 5404 [2025-02-08 00:13:45,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:13:45,122 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 2322 mSDsluCounter, 10094 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 11499 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:45,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 11499 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:13:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2025-02-08 00:13:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 5055. [2025-02-08 00:13:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5054 states have (on average 1.4469726948951325) internal successors, (7313), 5054 states have internal predecessors, (7313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 7313 transitions. [2025-02-08 00:13:45,167 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 7313 transitions. Word has length 205 [2025-02-08 00:13:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:45,168 INFO L471 AbstractCegarLoop]: Abstraction has 5055 states and 7313 transitions. [2025-02-08 00:13:45,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 10 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 7313 transitions. [2025-02-08 00:13:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-08 00:13:45,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:45,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:45,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 00:13:45,173 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:45,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 801403574, now seen corresponding path program 1 times [2025-02-08 00:13:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:45,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383769087] [2025-02-08 00:13:45,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 00:13:45,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 00:13:45,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:45,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:45,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383769087] [2025-02-08 00:13:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383769087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:45,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:45,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355361780] [2025-02-08 00:13:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:45,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:45,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:45,536 INFO L87 Difference]: Start difference. First operand 5055 states and 7313 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:45,961 INFO L93 Difference]: Finished difference Result 7028 states and 10169 transitions. [2025-02-08 00:13:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:45,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-02-08 00:13:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:45,966 INFO L225 Difference]: With dead ends: 7028 [2025-02-08 00:13:45,966 INFO L226 Difference]: Without dead ends: 5071 [2025-02-08 00:13:45,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:45,968 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:45,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4294 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:13:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5071 states. [2025-02-08 00:13:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5071 to 5071. [2025-02-08 00:13:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 5070 states have (on average 1.4455621301775148) internal successors, (7329), 5070 states have internal predecessors, (7329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 7329 transitions. [2025-02-08 00:13:46,036 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 7329 transitions. Word has length 205 [2025-02-08 00:13:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:46,037 INFO L471 AbstractCegarLoop]: Abstraction has 5071 states and 7329 transitions. [2025-02-08 00:13:46,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 7329 transitions. [2025-02-08 00:13:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-08 00:13:46,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:46,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:46,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 00:13:46,046 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:46,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:46,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1923347108, now seen corresponding path program 1 times [2025-02-08 00:13:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:46,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536944716] [2025-02-08 00:13:46,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:46,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 00:13:46,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 00:13:46,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:46,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536944716] [2025-02-08 00:13:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536944716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:46,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:46,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 00:13:46,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321288111] [2025-02-08 00:13:46,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:46,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 00:13:46,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:46,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 00:13:46,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:13:46,896 INFO L87 Difference]: Start difference. First operand 5071 states and 7329 transitions. Second operand has 15 states, 15 states have (on average 13.666666666666666) internal successors, (205), 15 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:48,326 INFO L93 Difference]: Finished difference Result 7322 states and 10561 transitions. [2025-02-08 00:13:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 00:13:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.666666666666666) internal successors, (205), 15 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-02-08 00:13:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:48,331 INFO L225 Difference]: With dead ends: 7322 [2025-02-08 00:13:48,331 INFO L226 Difference]: Without dead ends: 5375 [2025-02-08 00:13:48,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:13:48,334 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 71 mSDsluCounter, 18433 mSDsCounter, 0 mSdLazyCounter, 4305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 19853 SdHoareTripleChecker+Invalid, 4305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:48,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 19853 Invalid, 4305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4305 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 00:13:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2025-02-08 00:13:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5315. [2025-02-08 00:13:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5315 states, 5314 states have (on average 1.4420398946179902) internal successors, (7663), 5314 states have internal predecessors, (7663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 7663 transitions. [2025-02-08 00:13:48,389 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 7663 transitions. Word has length 205 [2025-02-08 00:13:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:48,389 INFO L471 AbstractCegarLoop]: Abstraction has 5315 states and 7663 transitions. [2025-02-08 00:13:48,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.666666666666666) internal successors, (205), 15 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 7663 transitions. [2025-02-08 00:13:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-08 00:13:48,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:48,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:48,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 00:13:48,394 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -881404699, now seen corresponding path program 1 times [2025-02-08 00:13:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338774916] [2025-02-08 00:13:48,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:48,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 00:13:48,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 00:13:48,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:48,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338774916] [2025-02-08 00:13:48,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338774916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:48,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:48,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42594215] [2025-02-08 00:13:48,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:48,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:48,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:48,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:48,868 INFO L87 Difference]: Start difference. First operand 5315 states and 7663 transitions. Second operand has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:49,914 INFO L93 Difference]: Finished difference Result 8310 states and 11944 transitions. [2025-02-08 00:13:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-02-08 00:13:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:49,920 INFO L225 Difference]: With dead ends: 8310 [2025-02-08 00:13:49,920 INFO L226 Difference]: Without dead ends: 6226 [2025-02-08 00:13:49,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:49,924 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 2450 mSDsluCounter, 3771 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2450 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:49,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2450 Valid, 5079 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:13:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6226 states. [2025-02-08 00:13:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6226 to 5581. [2025-02-08 00:13:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5581 states, 5580 states have (on average 1.4378136200716847) internal successors, (8023), 5580 states have internal predecessors, (8023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5581 states to 5581 states and 8023 transitions. [2025-02-08 00:13:50,014 INFO L78 Accepts]: Start accepts. Automaton has 5581 states and 8023 transitions. Word has length 205 [2025-02-08 00:13:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:50,015 INFO L471 AbstractCegarLoop]: Abstraction has 5581 states and 8023 transitions. [2025-02-08 00:13:50,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5581 states and 8023 transitions. [2025-02-08 00:13:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-08 00:13:50,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:50,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:50,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 00:13:50,028 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:50,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash 131546750, now seen corresponding path program 1 times [2025-02-08 00:13:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:50,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167175477] [2025-02-08 00:13:50,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:50,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:50,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 00:13:50,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 00:13:50,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:50,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167175477] [2025-02-08 00:13:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167175477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196598419] [2025-02-08 00:13:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:50,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:50,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:50,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:50,513 INFO L87 Difference]: Start difference. First operand 5581 states and 8023 transitions. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:52,008 INFO L93 Difference]: Finished difference Result 11900 states and 17035 transitions. [2025-02-08 00:13:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:13:52,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-02-08 00:13:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:52,014 INFO L225 Difference]: With dead ends: 11900 [2025-02-08 00:13:52,014 INFO L226 Difference]: Without dead ends: 9897 [2025-02-08 00:13:52,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:52,016 INFO L435 NwaCegarLoop]: 1946 mSDtfsCounter, 831 mSDsluCounter, 8523 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 10469 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:52,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 10469 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 00:13:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9897 states. [2025-02-08 00:13:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9897 to 8955. [2025-02-08 00:13:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8955 states, 8954 states have (on average 1.4258431985704714) internal successors, (12767), 8954 states have internal predecessors, (12767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8955 states to 8955 states and 12767 transitions. [2025-02-08 00:13:52,075 INFO L78 Accepts]: Start accepts. Automaton has 8955 states and 12767 transitions. Word has length 205 [2025-02-08 00:13:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:52,075 INFO L471 AbstractCegarLoop]: Abstraction has 8955 states and 12767 transitions. [2025-02-08 00:13:52,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8955 states and 12767 transitions. [2025-02-08 00:13:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:13:52,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:52,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:52,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 00:13:52,085 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:52,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1510078093, now seen corresponding path program 1 times [2025-02-08 00:13:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:52,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240591489] [2025-02-08 00:13:52,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:52,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:13:52,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:13:52,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:52,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:52,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240591489] [2025-02-08 00:13:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240591489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811251174] [2025-02-08 00:13:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:52,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:13:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:52,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:13:52,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:13:52,554 INFO L87 Difference]: Start difference. First operand 8955 states and 12767 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:53,443 INFO L93 Difference]: Finished difference Result 11567 states and 16518 transitions. [2025-02-08 00:13:53,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:53,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:13:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:53,451 INFO L225 Difference]: With dead ends: 11567 [2025-02-08 00:13:53,452 INFO L226 Difference]: Without dead ends: 9576 [2025-02-08 00:13:53,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:53,455 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 2153 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2153 SdHoareTripleChecker+Valid, 4672 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:53,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2153 Valid, 4672 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:13:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9576 states. [2025-02-08 00:13:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9576 to 9157. [2025-02-08 00:13:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9157 states, 9156 states have (on average 1.423219746614242) internal successors, (13031), 9156 states have internal predecessors, (13031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9157 states to 9157 states and 13031 transitions. [2025-02-08 00:13:53,523 INFO L78 Accepts]: Start accepts. Automaton has 9157 states and 13031 transitions. Word has length 206 [2025-02-08 00:13:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:53,523 INFO L471 AbstractCegarLoop]: Abstraction has 9157 states and 13031 transitions. [2025-02-08 00:13:53,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9157 states and 13031 transitions. [2025-02-08 00:13:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:13:53,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:53,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:53,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 00:13:53,531 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:53,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:53,531 INFO L85 PathProgramCache]: Analyzing trace with hash -200034029, now seen corresponding path program 1 times [2025-02-08 00:13:53,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:53,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996342744] [2025-02-08 00:13:53,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:53,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:53,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:13:53,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:13:53,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:53,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996342744] [2025-02-08 00:13:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996342744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-08 00:13:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780853909] [2025-02-08 00:13:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:54,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 00:13:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:54,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 00:13:54,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:13:54,746 INFO L87 Difference]: Start difference. First operand 9157 states and 13031 transitions. Second operand has 18 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:56,613 INFO L93 Difference]: Finished difference Result 11747 states and 16731 transitions. [2025-02-08 00:13:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 00:13:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:13:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:56,621 INFO L225 Difference]: With dead ends: 11747 [2025-02-08 00:13:56,621 INFO L226 Difference]: Without dead ends: 9801 [2025-02-08 00:13:56,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-02-08 00:13:56,624 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 109 mSDsluCounter, 22677 mSDsCounter, 0 mSdLazyCounter, 5377 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 24097 SdHoareTripleChecker+Invalid, 5377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:56,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 24097 Invalid, 5377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5377 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 00:13:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9801 states. [2025-02-08 00:13:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9801 to 9693. [2025-02-08 00:13:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9693 states, 9692 states have (on average 1.4223070573669006) internal successors, (13785), 9692 states have internal predecessors, (13785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9693 states to 9693 states and 13785 transitions. [2025-02-08 00:13:56,743 INFO L78 Accepts]: Start accepts. Automaton has 9693 states and 13785 transitions. Word has length 206 [2025-02-08 00:13:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:56,744 INFO L471 AbstractCegarLoop]: Abstraction has 9693 states and 13785 transitions. [2025-02-08 00:13:56,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.444444444444445) internal successors, (206), 18 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 9693 states and 13785 transitions. [2025-02-08 00:13:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:13:56,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:56,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:56,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 00:13:56,752 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:56,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1433612122, now seen corresponding path program 1 times [2025-02-08 00:13:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246257502] [2025-02-08 00:13:56,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:56,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:13:56,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:13:56,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:56,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246257502] [2025-02-08 00:13:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246257502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:57,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:57,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-08 00:13:57,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383239397] [2025-02-08 00:13:57,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:57,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 00:13:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:57,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 00:13:57,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:13:57,772 INFO L87 Difference]: Start difference. First operand 9693 states and 13785 transitions. Second operand has 20 states, 20 states have (on average 10.3) internal successors, (206), 20 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:59,852 INFO L93 Difference]: Finished difference Result 11932 states and 16992 transitions. [2025-02-08 00:13:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:13:59,853 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.3) internal successors, (206), 20 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:13:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:59,859 INFO L225 Difference]: With dead ends: 11932 [2025-02-08 00:13:59,860 INFO L226 Difference]: Without dead ends: 9903 [2025-02-08 00:13:59,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:13:59,862 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 116 mSDsluCounter, 24010 mSDsCounter, 0 mSdLazyCounter, 5814 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 25425 SdHoareTripleChecker+Invalid, 5814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:59,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 25425 Invalid, 5814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5814 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-08 00:13:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9903 states. [2025-02-08 00:13:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9903 to 9859. [2025-02-08 00:13:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9859 states, 9858 states have (on average 1.4224994927977277) internal successors, (14023), 9858 states have internal predecessors, (14023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9859 states to 9859 states and 14023 transitions. [2025-02-08 00:13:59,966 INFO L78 Accepts]: Start accepts. Automaton has 9859 states and 14023 transitions. Word has length 206 [2025-02-08 00:13:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:59,967 INFO L471 AbstractCegarLoop]: Abstraction has 9859 states and 14023 transitions. [2025-02-08 00:13:59,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.3) internal successors, (206), 20 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:13:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9859 states and 14023 transitions. [2025-02-08 00:13:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:13:59,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:59,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:13:59,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 00:13:59,976 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1274339667, now seen corresponding path program 1 times [2025-02-08 00:13:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89896823] [2025-02-08 00:13:59,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:00,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:00,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:00,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:00,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89896823] [2025-02-08 00:14:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89896823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287037870] [2025-02-08 00:14:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:00,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:00,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:00,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:00,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:00,236 INFO L87 Difference]: Start difference. First operand 9859 states and 14023 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:00,724 INFO L93 Difference]: Finished difference Result 12858 states and 18315 transitions. [2025-02-08 00:14:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:14:00,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:00,733 INFO L225 Difference]: With dead ends: 12858 [2025-02-08 00:14:00,733 INFO L226 Difference]: Without dead ends: 9931 [2025-02-08 00:14:00,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:00,737 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 0 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5723 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:00,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5723 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:14:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9931 states. [2025-02-08 00:14:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9931 to 9931. [2025-02-08 00:14:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9931 states, 9930 states have (on average 1.419436052366566) internal successors, (14095), 9930 states have internal predecessors, (14095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9931 states to 9931 states and 14095 transitions. [2025-02-08 00:14:00,814 INFO L78 Accepts]: Start accepts. Automaton has 9931 states and 14095 transitions. Word has length 206 [2025-02-08 00:14:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:00,814 INFO L471 AbstractCegarLoop]: Abstraction has 9931 states and 14095 transitions. [2025-02-08 00:14:00,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 9931 states and 14095 transitions. [2025-02-08 00:14:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:14:00,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:00,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:00,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 00:14:00,822 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:00,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1050026102, now seen corresponding path program 1 times [2025-02-08 00:14:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910535796] [2025-02-08 00:14:00,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:00,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:00,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:00,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:00,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:00,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:01,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:01,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910535796] [2025-02-08 00:14:01,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910535796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:01,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:01,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936203147] [2025-02-08 00:14:01,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:01,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:01,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:01,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:01,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:14:01,221 INFO L87 Difference]: Start difference. First operand 9931 states and 14095 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:01,779 INFO L93 Difference]: Finished difference Result 12888 states and 18323 transitions. [2025-02-08 00:14:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:01,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:01,791 INFO L225 Difference]: With dead ends: 12888 [2025-02-08 00:14:01,791 INFO L226 Difference]: Without dead ends: 10384 [2025-02-08 00:14:01,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:01,797 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 459 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 5725 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:01,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 5725 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10384 states. [2025-02-08 00:14:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10384 to 9893. [2025-02-08 00:14:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9893 states, 9892 states have (on average 1.4196320258794985) internal successors, (14043), 9892 states have internal predecessors, (14043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9893 states to 9893 states and 14043 transitions. [2025-02-08 00:14:01,880 INFO L78 Accepts]: Start accepts. Automaton has 9893 states and 14043 transitions. Word has length 206 [2025-02-08 00:14:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:01,880 INFO L471 AbstractCegarLoop]: Abstraction has 9893 states and 14043 transitions. [2025-02-08 00:14:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 9893 states and 14043 transitions. [2025-02-08 00:14:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:14:01,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:01,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:01,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 00:14:01,897 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:01,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1018925550, now seen corresponding path program 1 times [2025-02-08 00:14:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:01,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100137400] [2025-02-08 00:14:01,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:01,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:01,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:01,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:01,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:02,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100137400] [2025-02-08 00:14:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100137400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:02,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:02,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701587573] [2025-02-08 00:14:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:02,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:02,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:02,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:02,390 INFO L87 Difference]: Start difference. First operand 9893 states and 14043 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:02,923 INFO L93 Difference]: Finished difference Result 21880 states and 30817 transitions. [2025-02-08 00:14:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:02,939 INFO L225 Difference]: With dead ends: 21880 [2025-02-08 00:14:02,940 INFO L226 Difference]: Without dead ends: 17311 [2025-02-08 00:14:02,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:02,948 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2305 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:02,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 5631 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17311 states. [2025-02-08 00:14:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17311 to 14941. [2025-02-08 00:14:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14941 states, 14940 states have (on average 1.418942436412316) internal successors, (21199), 14940 states have internal predecessors, (21199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14941 states to 14941 states and 21199 transitions. [2025-02-08 00:14:03,069 INFO L78 Accepts]: Start accepts. Automaton has 14941 states and 21199 transitions. Word has length 206 [2025-02-08 00:14:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:03,070 INFO L471 AbstractCegarLoop]: Abstraction has 14941 states and 21199 transitions. [2025-02-08 00:14:03,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 14941 states and 21199 transitions. [2025-02-08 00:14:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:14:03,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:03,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:03,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-08 00:14:03,085 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:03,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:03,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1810442551, now seen corresponding path program 1 times [2025-02-08 00:14:03,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:03,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471711352] [2025-02-08 00:14:03,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:03,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:03,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:03,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:03,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471711352] [2025-02-08 00:14:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471711352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:03,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:03,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001096361] [2025-02-08 00:14:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:03,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:03,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:03,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:03,613 INFO L87 Difference]: Start difference. First operand 14941 states and 21199 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:04,169 INFO L93 Difference]: Finished difference Result 34542 states and 48579 transitions. [2025-02-08 00:14:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:04,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:04,194 INFO L225 Difference]: With dead ends: 34542 [2025-02-08 00:14:04,194 INFO L226 Difference]: Without dead ends: 26769 [2025-02-08 00:14:04,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:04,206 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2006 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:04,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 5631 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26769 states. [2025-02-08 00:14:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26769 to 14941. [2025-02-08 00:14:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14941 states, 14940 states have (on average 1.418942436412316) internal successors, (21199), 14940 states have internal predecessors, (21199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14941 states to 14941 states and 21199 transitions. [2025-02-08 00:14:04,359 INFO L78 Accepts]: Start accepts. Automaton has 14941 states and 21199 transitions. Word has length 206 [2025-02-08 00:14:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:04,359 INFO L471 AbstractCegarLoop]: Abstraction has 14941 states and 21199 transitions. [2025-02-08 00:14:04,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 14941 states and 21199 transitions. [2025-02-08 00:14:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:14:04,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:04,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:04,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-08 00:14:04,371 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash 479095009, now seen corresponding path program 1 times [2025-02-08 00:14:04,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:04,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597686261] [2025-02-08 00:14:04,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:04,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:04,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:04,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:04,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:04,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:04,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:04,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597686261] [2025-02-08 00:14:04,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597686261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:04,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:04,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:04,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134993396] [2025-02-08 00:14:04,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:04,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:04,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:04,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:04,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:04,817 INFO L87 Difference]: Start difference. First operand 14941 states and 21199 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:06,195 INFO L93 Difference]: Finished difference Result 17908 states and 25459 transitions. [2025-02-08 00:14:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:06,209 INFO L225 Difference]: With dead ends: 17908 [2025-02-08 00:14:06,210 INFO L226 Difference]: Without dead ends: 15638 [2025-02-08 00:14:06,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:06,219 INFO L435 NwaCegarLoop]: 1829 mSDtfsCounter, 483 mSDsluCounter, 5863 mSDsCounter, 0 mSdLazyCounter, 3082 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 7692 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:06,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 7692 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3082 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:14:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15638 states. [2025-02-08 00:14:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15638 to 13737. [2025-02-08 00:14:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13737 states, 13736 states have (on average 1.4236313337216076) internal successors, (19555), 13736 states have internal predecessors, (19555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 19555 transitions. [2025-02-08 00:14:06,348 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 19555 transitions. Word has length 206 [2025-02-08 00:14:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:06,348 INFO L471 AbstractCegarLoop]: Abstraction has 13737 states and 19555 transitions. [2025-02-08 00:14:06,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 19555 transitions. [2025-02-08 00:14:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:14:06,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:06,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-08 00:14:06,362 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1558166841, now seen corresponding path program 1 times [2025-02-08 00:14:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675484522] [2025-02-08 00:14:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:06,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:06,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:06,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:06,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:07,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675484522] [2025-02-08 00:14:07,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675484522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:07,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:07,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13752199] [2025-02-08 00:14:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:07,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:07,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:07,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:07,090 INFO L87 Difference]: Start difference. First operand 13737 states and 19555 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:08,523 INFO L93 Difference]: Finished difference Result 19969 states and 28264 transitions. [2025-02-08 00:14:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:08,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:08,535 INFO L225 Difference]: With dead ends: 19969 [2025-02-08 00:14:08,535 INFO L226 Difference]: Without dead ends: 16616 [2025-02-08 00:14:08,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:08,538 INFO L435 NwaCegarLoop]: 1432 mSDtfsCounter, 1983 mSDsluCounter, 4008 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 5440 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:08,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 5440 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2525 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 00:14:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16616 states. [2025-02-08 00:14:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16616 to 14761. [2025-02-08 00:14:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14761 states, 14760 states have (on average 1.4170054200542006) internal successors, (20915), 14760 states have internal predecessors, (20915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14761 states to 14761 states and 20915 transitions. [2025-02-08 00:14:08,663 INFO L78 Accepts]: Start accepts. Automaton has 14761 states and 20915 transitions. Word has length 206 [2025-02-08 00:14:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:08,663 INFO L471 AbstractCegarLoop]: Abstraction has 14761 states and 20915 transitions. [2025-02-08 00:14:08,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 14761 states and 20915 transitions. [2025-02-08 00:14:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:14:08,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:08,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-08 00:14:08,677 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:08,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2042686966, now seen corresponding path program 1 times [2025-02-08 00:14:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756019260] [2025-02-08 00:14:08,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:08,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:08,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:08,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:08,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:08,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756019260] [2025-02-08 00:14:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756019260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:09,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:09,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754430594] [2025-02-08 00:14:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:09,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:09,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:09,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:09,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:09,316 INFO L87 Difference]: Start difference. First operand 14761 states and 20915 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:10,458 INFO L93 Difference]: Finished difference Result 20432 states and 28854 transitions. [2025-02-08 00:14:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:10,476 INFO L225 Difference]: With dead ends: 20432 [2025-02-08 00:14:10,477 INFO L226 Difference]: Without dead ends: 18038 [2025-02-08 00:14:10,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:10,488 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 1916 mSDsluCounter, 3945 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 5346 SdHoareTripleChecker+Invalid, 2463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:10,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 5346 Invalid, 2463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 00:14:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18038 states. [2025-02-08 00:14:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18038 to 14761. [2025-02-08 00:14:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14761 states, 14760 states have (on average 1.4170054200542006) internal successors, (20915), 14760 states have internal predecessors, (20915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14761 states to 14761 states and 20915 transitions. [2025-02-08 00:14:10,627 INFO L78 Accepts]: Start accepts. Automaton has 14761 states and 20915 transitions. Word has length 206 [2025-02-08 00:14:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:10,628 INFO L471 AbstractCegarLoop]: Abstraction has 14761 states and 20915 transitions. [2025-02-08 00:14:10,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 14761 states and 20915 transitions. [2025-02-08 00:14:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-08 00:14:10,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:10,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:10,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-08 00:14:10,641 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:10,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1692057685, now seen corresponding path program 1 times [2025-02-08 00:14:10,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:10,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455548109] [2025-02-08 00:14:10,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:10,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:10,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-08 00:14:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-08 00:14:10,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:10,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:11,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455548109] [2025-02-08 00:14:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455548109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91360252] [2025-02-08 00:14:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:11,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:11,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:11,350 INFO L87 Difference]: Start difference. First operand 14761 states and 20915 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:11,980 INFO L93 Difference]: Finished difference Result 34742 states and 48855 transitions. [2025-02-08 00:14:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-08 00:14:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:12,007 INFO L225 Difference]: With dead ends: 34742 [2025-02-08 00:14:12,007 INFO L226 Difference]: Without dead ends: 25519 [2025-02-08 00:14:12,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:12,022 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2330 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:12,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 5631 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25519 states. [2025-02-08 00:14:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25519 to 17473. [2025-02-08 00:14:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17473 states, 17472 states have (on average 1.4292010073260073) internal successors, (24971), 17472 states have internal predecessors, (24971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17473 states to 17473 states and 24971 transitions. [2025-02-08 00:14:12,209 INFO L78 Accepts]: Start accepts. Automaton has 17473 states and 24971 transitions. Word has length 206 [2025-02-08 00:14:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:12,209 INFO L471 AbstractCegarLoop]: Abstraction has 17473 states and 24971 transitions. [2025-02-08 00:14:12,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 17473 states and 24971 transitions. [2025-02-08 00:14:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-08 00:14:12,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:12,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:12,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-08 00:14:12,225 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:12,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1639706557, now seen corresponding path program 1 times [2025-02-08 00:14:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953088993] [2025-02-08 00:14:12,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:12,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 00:14:12,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 00:14:12,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:12,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:12,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:12,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953088993] [2025-02-08 00:14:12,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953088993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:12,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:12,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:14:12,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357521752] [2025-02-08 00:14:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:12,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:14:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:12,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:14:12,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:12,927 INFO L87 Difference]: Start difference. First operand 17473 states and 24971 transitions. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:13,898 INFO L93 Difference]: Finished difference Result 36919 states and 52483 transitions. [2025-02-08 00:14:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-02-08 00:14:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:13,930 INFO L225 Difference]: With dead ends: 36919 [2025-02-08 00:14:13,930 INFO L226 Difference]: Without dead ends: 32467 [2025-02-08 00:14:13,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:14:13,943 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2006 mSDsluCounter, 5626 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 7036 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:13,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 7036 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:14:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32467 states. [2025-02-08 00:14:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32467 to 17617. [2025-02-08 00:14:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17617 states, 17616 states have (on average 1.4297797456857402) internal successors, (25187), 17616 states have internal predecessors, (25187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17617 states to 17617 states and 25187 transitions. [2025-02-08 00:14:14,181 INFO L78 Accepts]: Start accepts. Automaton has 17617 states and 25187 transitions. Word has length 207 [2025-02-08 00:14:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:14,181 INFO L471 AbstractCegarLoop]: Abstraction has 17617 states and 25187 transitions. [2025-02-08 00:14:14,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 17617 states and 25187 transitions. [2025-02-08 00:14:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-08 00:14:14,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:14,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:14,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-08 00:14:14,197 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:14,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:14,197 INFO L85 PathProgramCache]: Analyzing trace with hash 840424273, now seen corresponding path program 1 times [2025-02-08 00:14:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010195057] [2025-02-08 00:14:14,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:14,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:14,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 00:14:14,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 00:14:14,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:14,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:14,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010195057] [2025-02-08 00:14:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010195057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:14,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:14:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640996122] [2025-02-08 00:14:14,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:14,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:14,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:14:14,639 INFO L87 Difference]: Start difference. First operand 17617 states and 25187 transitions. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:15,221 INFO L93 Difference]: Finished difference Result 35047 states and 49807 transitions. [2025-02-08 00:14:15,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:15,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-02-08 00:14:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:15,251 INFO L225 Difference]: With dead ends: 35047 [2025-02-08 00:14:15,252 INFO L226 Difference]: Without dead ends: 31487 [2025-02-08 00:14:15,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:14:15,264 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 2301 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:15,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2301 Valid, 5631 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31487 states. [2025-02-08 00:14:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31487 to 30649. [2025-02-08 00:14:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30649 states, 30648 states have (on average 1.4245301487862176) internal successors, (43659), 30648 states have internal predecessors, (43659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30649 states to 30649 states and 43659 transitions. [2025-02-08 00:14:15,607 INFO L78 Accepts]: Start accepts. Automaton has 30649 states and 43659 transitions. Word has length 207 [2025-02-08 00:14:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 30649 states and 43659 transitions. [2025-02-08 00:14:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:14:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 30649 states and 43659 transitions. [2025-02-08 00:14:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-08 00:14:15,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:15,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:15,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-08 00:14:15,636 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:15,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2088481187, now seen corresponding path program 1 times [2025-02-08 00:14:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492997355] [2025-02-08 00:14:15,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:15,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 00:14:15,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 00:14:15,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:15,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:14:15,904 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:14:15,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 00:14:16,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 00:14:16,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:16,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:14:16,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:14:16,244 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:14:16,245 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:14:16,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-08 00:14:16,252 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, 1, 1, 1, 1, 1, 1, 1, 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-02-08 00:14:16,400 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:14:16,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:14:16,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:14:16 BoogieIcfgContainer [2025-02-08 00:14:16,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:14:16,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:14:16,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:14:16,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:14:16,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:01" (3/4) ... [2025-02-08 00:14:16,452 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:14:16,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:14:16,453 INFO L158 Benchmark]: Toolchain (without parser) took 80691.29ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 111.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 644.0MB. Max. memory is 16.1GB. [2025-02-08 00:14:16,457 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:14:16,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.84ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 83.8MB in the end (delta: 26.5MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2025-02-08 00:14:16,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 458.34ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 83.8MB in the beginning and 335.8MB in the end (delta: -252.0MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2025-02-08 00:14:16,458 INFO L158 Benchmark]: Boogie Preprocessor took 451.84ms. Allocated memory is still 453.0MB. Free memory was 335.8MB in the beginning and 324.0MB in the end (delta: 11.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2025-02-08 00:14:16,458 INFO L158 Benchmark]: IcfgBuilder took 3913.13ms. Allocated memory was 453.0MB in the beginning and 947.9MB in the end (delta: 494.9MB). Free memory was 324.0MB in the beginning and 474.4MB in the end (delta: -150.4MB). Peak memory consumption was 349.6MB. Max. memory is 16.1GB. [2025-02-08 00:14:16,458 INFO L158 Benchmark]: TraceAbstraction took 75240.83ms. Allocated memory was 947.9MB in the beginning and 1.9GB in the end (delta: 947.9MB). Free memory was 474.4MB in the beginning and 1.2GB in the end (delta: -746.3MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. [2025-02-08 00:14:16,458 INFO L158 Benchmark]: Witness Printer took 9.09ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:14:16,459 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.84ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 83.8MB in the end (delta: 26.5MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 458.34ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 83.8MB in the beginning and 335.8MB in the end (delta: -252.0MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 451.84ms. Allocated memory is still 453.0MB. Free memory was 335.8MB in the beginning and 324.0MB in the end (delta: 11.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * IcfgBuilder took 3913.13ms. Allocated memory was 453.0MB in the beginning and 947.9MB in the end (delta: 494.9MB). Free memory was 324.0MB in the beginning and 474.4MB in the end (delta: -150.4MB). Peak memory consumption was 349.6MB. Max. memory is 16.1GB. * TraceAbstraction took 75240.83ms. Allocated memory was 947.9MB in the beginning and 1.9GB in the end (delta: 947.9MB). Free memory was 474.4MB in the beginning and 1.2GB in the end (delta: -746.3MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. * Witness Printer took 9.09ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwiseAnd at line 528, overapproximation of bitwiseAnd at line 412. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_25 mask_SORT_25 = (SORT_25)-1 >> (sizeof(SORT_25) * 8 - 4); [L33] const SORT_25 msb_SORT_25 = (SORT_25)1 << (4 - 1); [L35] const SORT_187 mask_SORT_187 = (SORT_187)-1 >> (sizeof(SORT_187) * 8 - 32); [L36] const SORT_187 msb_SORT_187 = (SORT_187)1 << (32 - 1); [L38] const SORT_195 mask_SORT_195 = (SORT_195)-1 >> (sizeof(SORT_195) * 8 - 3); [L39] const SORT_195 msb_SORT_195 = (SORT_195)1 << (3 - 1); [L41] const SORT_1 var_11 = 0; [L42] const SORT_3 var_14 = 2; [L43] const SORT_1 var_28 = 1; [L44] const SORT_187 var_189 = 1; [L45] const SORT_3 var_274 = 0; [L46] const SORT_3 var_275 = 3; [L47] const SORT_187 var_284 = 0; [L48] const SORT_187 var_495 = 2; [L50] SORT_1 input_2; [L51] SORT_3 input_4; [L52] SORT_3 input_5; [L53] SORT_1 input_6; [L54] SORT_3 input_7; [L55] SORT_1 input_8; [L56] SORT_1 input_9; [L57] SORT_1 input_181; [L58] SORT_3 input_273; [L59] SORT_3 input_289; [L60] SORT_3 input_290; [L61] SORT_3 input_291; [L62] SORT_3 input_292; [L63] SORT_3 input_319; [L64] SORT_3 input_320; [L65] SORT_3 input_321; [L66] SORT_3 input_330; [L67] SORT_3 input_384; [L68] SORT_3 input_396; [L69] SORT_3 input_397; [L70] SORT_3 input_398; [L71] SORT_3 input_399; [L72] SORT_3 input_408; [L73] SORT_3 input_429; [L74] SORT_3 input_430; [L75] SORT_3 input_431; [L76] SORT_3 input_440; [L77] SORT_3 input_442; [L78] SORT_3 input_488; [L79] SORT_3 input_502; [L80] SORT_3 input_503; [L81] SORT_3 input_504; [L82] SORT_3 input_505; [L83] SORT_3 input_514; [L84] SORT_3 input_516; [L85] SORT_3 input_538; [L86] SORT_3 input_539; [L87] SORT_3 input_540; [L88] SORT_3 input_549; [L89] SORT_3 input_551; [L90] SORT_3 input_553; [L91] SORT_3 input_599; [L92] SORT_3 input_610; [L93] SORT_3 input_611; [L94] SORT_3 input_612; [L95] SORT_3 input_620; [L96] SORT_3 input_622; [L97] SORT_3 input_624; [L98] SORT_3 input_644; [L99] SORT_3 input_645; [L100] SORT_3 input_653; [L101] SORT_3 input_655; [L102] SORT_3 input_657; [L103] SORT_3 input_659; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L105] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L106] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L107] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L108] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L109] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_25 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_25=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L110] SORT_25 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_25; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_25 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L111] SORT_25 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_25; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L112] SORT_3 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L113] SORT_3 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L114] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L115] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L116] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L117] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L118] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L119] SORT_3 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L120] SORT_3 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L121] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L122] SORT_3 state_79 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L123] SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L124] SORT_3 state_148 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L125] SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L126] SORT_3 state_150 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L127] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L127] SORT_3 state_151 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L128] SORT_3 state_152 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L129] SORT_3 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L130] SORT_3 state_154 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L131] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L131] SORT_3 state_155 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L132] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L132] SORT_3 state_156 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L133] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L133] SORT_3 state_157 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L134] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L134] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L135] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L135] SORT_3 state_159 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L136] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L136] SORT_3 state_160 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L137] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L137] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L138] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L138] SORT_3 state_162 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L139] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L139] SORT_3 state_163 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L143] input_2 = __VERIFIER_nondet_uchar() [L144] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L144] input_2 = input_2 & mask_SORT_1 [L145] input_4 = __VERIFIER_nondet_uchar() [L146] input_5 = __VERIFIER_nondet_uchar() [L147] input_6 = __VERIFIER_nondet_uchar() [L148] input_7 = __VERIFIER_nondet_uchar() [L149] input_8 = __VERIFIER_nondet_uchar() [L150] input_9 = __VERIFIER_nondet_uchar() [L151] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L151] input_9 = input_9 & mask_SORT_1 [L152] input_181 = __VERIFIER_nondet_uchar() [L153] input_273 = __VERIFIER_nondet_uchar() [L154] input_289 = __VERIFIER_nondet_uchar() [L155] input_290 = __VERIFIER_nondet_uchar() [L156] input_291 = __VERIFIER_nondet_uchar() [L157] input_292 = __VERIFIER_nondet_uchar() [L158] input_319 = __VERIFIER_nondet_uchar() [L159] input_320 = __VERIFIER_nondet_uchar() [L160] input_321 = __VERIFIER_nondet_uchar() [L161] input_330 = __VERIFIER_nondet_uchar() [L162] input_384 = __VERIFIER_nondet_uchar() [L163] input_396 = __VERIFIER_nondet_uchar() [L164] input_397 = __VERIFIER_nondet_uchar() [L165] input_398 = __VERIFIER_nondet_uchar() [L166] input_399 = __VERIFIER_nondet_uchar() [L167] input_408 = __VERIFIER_nondet_uchar() [L168] input_429 = __VERIFIER_nondet_uchar() [L169] input_430 = __VERIFIER_nondet_uchar() [L170] input_431 = __VERIFIER_nondet_uchar() [L171] input_440 = __VERIFIER_nondet_uchar() [L172] input_442 = __VERIFIER_nondet_uchar() [L173] input_488 = __VERIFIER_nondet_uchar() [L174] input_502 = __VERIFIER_nondet_uchar() [L175] input_503 = __VERIFIER_nondet_uchar() [L176] input_504 = __VERIFIER_nondet_uchar() [L177] input_505 = __VERIFIER_nondet_uchar() [L178] input_514 = __VERIFIER_nondet_uchar() [L179] input_516 = __VERIFIER_nondet_uchar() [L180] input_538 = __VERIFIER_nondet_uchar() [L181] input_539 = __VERIFIER_nondet_uchar() [L182] input_540 = __VERIFIER_nondet_uchar() [L183] input_549 = __VERIFIER_nondet_uchar() [L184] input_551 = __VERIFIER_nondet_uchar() [L185] input_553 = __VERIFIER_nondet_uchar() [L186] input_599 = __VERIFIER_nondet_uchar() [L187] input_610 = __VERIFIER_nondet_uchar() [L188] input_611 = __VERIFIER_nondet_uchar() [L189] input_612 = __VERIFIER_nondet_uchar() [L190] input_620 = __VERIFIER_nondet_uchar() [L191] input_622 = __VERIFIER_nondet_uchar() [L192] input_624 = __VERIFIER_nondet_uchar() [L193] input_644 = __VERIFIER_nondet_uchar() [L194] input_645 = __VERIFIER_nondet_uchar() [L195] input_653 = __VERIFIER_nondet_uchar() [L196] input_655 = __VERIFIER_nondet_uchar() [L197] input_657 = __VERIFIER_nondet_uchar() [L198] input_659 = __VERIFIER_nondet_uchar() [L201] SORT_1 var_12_arg_0 = state_10; [L202] SORT_1 var_12_arg_1 = var_11; [L203] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L204] SORT_3 var_15_arg_0 = state_13; [L205] SORT_3 var_15_arg_1 = var_14; [L206] SORT_1 var_15 = var_15_arg_0 >= var_15_arg_1; [L207] SORT_3 var_17_arg_0 = state_16; [L208] SORT_3 var_17_arg_1 = var_14; [L209] SORT_1 var_17 = var_17_arg_0 >= var_17_arg_1; [L210] SORT_1 var_18_arg_0 = var_15; [L211] SORT_1 var_18_arg_1 = var_17; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_18_arg_0=0, var_18_arg_1=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L212] EXPR var_18_arg_0 & var_18_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L212] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L213] SORT_3 var_20_arg_0 = state_19; [L214] SORT_3 var_20_arg_1 = var_14; [L215] SORT_1 var_20 = var_20_arg_0 >= var_20_arg_1; [L216] SORT_1 var_21_arg_0 = var_18; [L217] SORT_1 var_21_arg_1 = var_20; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_21_arg_0=0, var_21_arg_1=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L218] EXPR var_21_arg_0 & var_21_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L218] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L219] SORT_3 var_23_arg_0 = state_22; [L220] SORT_3 var_23_arg_1 = var_14; [L221] SORT_1 var_23 = var_23_arg_0 >= var_23_arg_1; [L222] SORT_1 var_24_arg_0 = var_21; [L223] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_24_arg_0=0, var_24_arg_1=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L224] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L224] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L225] SORT_25 var_27_arg_0 = state_26; [L226] SORT_1 var_27 = var_27_arg_0 >> 3; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_24=0, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_495=2] [L227] EXPR var_27 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_24=0, var_274=0, var_275=3, var_284=0, var_28=1, var_495=2] [L227] var_27 = var_27 & mask_SORT_1 [L228] SORT_1 var_29_arg_0 = var_27; [L229] SORT_1 var_29_arg_1 = var_28; [L230] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L231] SORT_1 var_30_arg_0 = var_24; [L232] SORT_1 var_30_arg_1 = var_29; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_30_arg_0=0, var_30_arg_1=0, var_495=2] [L233] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_495=2] [L233] SORT_1 var_30 = var_30_arg_0 & var_30_arg_1; [L234] SORT_1 var_31_arg_0 = var_30; [L235] SORT_1 var_31 = ~var_31_arg_0; [L236] SORT_25 var_33_arg_0 = state_32; [L237] SORT_1 var_33 = var_33_arg_0 >> 3; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_31=-1, var_33=0, var_495=2] [L238] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_31=-1, var_495=2] [L238] var_33 = var_33 & mask_SORT_1 [L239] SORT_1 var_34_arg_0 = var_33; [L240] SORT_1 var_34_arg_1 = var_28; [L241] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L242] SORT_1 var_35_arg_0 = var_31; [L243] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35_arg_0=-1, var_35_arg_1=0, var_495=2] [L244] EXPR var_35_arg_0 | var_35_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_495=2] [L244] SORT_1 var_35 = var_35_arg_0 | var_35_arg_1; [L245] SORT_3 var_37_arg_0 = state_36; [L246] SORT_3 var_37_arg_1 = var_14; [L247] SORT_1 var_37 = var_37_arg_0 >= var_37_arg_1; [L248] SORT_3 var_39_arg_0 = state_38; [L249] SORT_3 var_39_arg_1 = var_14; [L250] SORT_1 var_39 = var_39_arg_0 >= var_39_arg_1; [L251] SORT_1 var_40_arg_0 = var_37; [L252] SORT_1 var_40_arg_1 = var_39; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_40_arg_0=0, var_40_arg_1=0, var_495=2] [L253] EXPR var_40_arg_0 & var_40_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_495=2] [L253] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L254] SORT_3 var_42_arg_0 = state_41; [L255] SORT_3 var_42_arg_1 = var_14; [L256] SORT_1 var_42 = var_42_arg_0 >= var_42_arg_1; [L257] SORT_1 var_43_arg_0 = var_40; [L258] SORT_1 var_43_arg_1 = var_42; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_43_arg_0=0, var_43_arg_1=0, var_495=2] [L259] EXPR var_43_arg_0 & var_43_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_495=2] [L259] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L260] SORT_3 var_45_arg_0 = state_44; [L261] SORT_3 var_45_arg_1 = var_14; [L262] SORT_1 var_45 = var_45_arg_0 >= var_45_arg_1; [L263] SORT_1 var_46_arg_0 = var_43; [L264] SORT_1 var_46_arg_1 = var_45; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_46_arg_0=0, var_46_arg_1=0, var_495=2] [L265] EXPR var_46_arg_0 & var_46_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_495=2] [L265] SORT_1 var_46 = var_46_arg_0 & var_46_arg_1; [L266] SORT_25 var_47_arg_0 = state_26; [L267] SORT_1 var_47 = var_47_arg_0 >> 2; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_46=0, var_47=0, var_495=2] [L268] EXPR var_47 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_46=0, var_495=2] [L268] var_47 = var_47 & mask_SORT_1 [L269] SORT_1 var_48_arg_0 = var_47; [L270] SORT_1 var_48_arg_1 = var_28; [L271] SORT_1 var_48 = var_48_arg_0 == var_48_arg_1; [L272] SORT_1 var_49_arg_0 = var_46; [L273] SORT_1 var_49_arg_1 = var_48; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_49_arg_0=0, var_49_arg_1=0] [L274] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2] [L274] SORT_1 var_49 = var_49_arg_0 & var_49_arg_1; [L275] SORT_1 var_50_arg_0 = var_49; [L276] SORT_1 var_50 = ~var_50_arg_0; [L277] SORT_25 var_51_arg_0 = state_32; [L278] SORT_1 var_51 = var_51_arg_0 >> 2; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_50=-1, var_51=0] [L279] EXPR var_51 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_50=-1] [L279] var_51 = var_51 & mask_SORT_1 [L280] SORT_1 var_52_arg_0 = var_51; [L281] SORT_1 var_52_arg_1 = var_28; [L282] SORT_1 var_52 = var_52_arg_0 == var_52_arg_1; [L283] SORT_1 var_53_arg_0 = var_50; [L284] SORT_1 var_53_arg_1 = var_52; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_51=0, var_53_arg_0=-1, var_53_arg_1=0] [L285] EXPR var_53_arg_0 | var_53_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_35=255, var_47=0, var_495=2, var_51=0] [L285] SORT_1 var_53 = var_53_arg_0 | var_53_arg_1; [L286] SORT_1 var_54_arg_0 = var_35; [L287] SORT_1 var_54_arg_1 = var_53; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54_arg_0=255, var_54_arg_1=255] [L288] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0] [L288] SORT_1 var_54 = var_54_arg_0 & var_54_arg_1; [L289] SORT_3 var_56_arg_0 = state_55; [L290] SORT_3 var_56_arg_1 = var_14; [L291] SORT_1 var_56 = var_56_arg_0 >= var_56_arg_1; [L292] SORT_3 var_58_arg_0 = state_57; [L293] SORT_3 var_58_arg_1 = var_14; [L294] SORT_1 var_58 = var_58_arg_0 >= var_58_arg_1; [L295] SORT_1 var_59_arg_0 = var_56; [L296] SORT_1 var_59_arg_1 = var_58; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_59_arg_0=0, var_59_arg_1=0] [L297] EXPR var_59_arg_0 & var_59_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255] [L297] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L298] SORT_3 var_61_arg_0 = state_60; [L299] SORT_3 var_61_arg_1 = var_14; [L300] SORT_1 var_61 = var_61_arg_0 >= var_61_arg_1; [L301] SORT_1 var_62_arg_0 = var_59; [L302] SORT_1 var_62_arg_1 = var_61; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_62_arg_0=0, var_62_arg_1=0] [L303] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255] [L303] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L304] SORT_3 var_64_arg_0 = state_63; [L305] SORT_3 var_64_arg_1 = var_14; [L306] SORT_1 var_64 = var_64_arg_0 >= var_64_arg_1; [L307] SORT_1 var_65_arg_0 = var_62; [L308] SORT_1 var_65_arg_1 = var_64; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_65_arg_0=0, var_65_arg_1=0] [L309] EXPR var_65_arg_0 & var_65_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255] [L309] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L310] SORT_25 var_66_arg_0 = state_26; [L311] SORT_1 var_66 = var_66_arg_0 >> 1; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_65=0, var_66=0] [L312] EXPR var_66 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_65=0] [L312] var_66 = var_66 & mask_SORT_1 [L313] SORT_1 var_67_arg_0 = var_66; [L314] SORT_1 var_67_arg_1 = var_28; [L315] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L316] SORT_1 var_68_arg_0 = var_65; [L317] SORT_1 var_68_arg_1 = var_67; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_68_arg_0=0, var_68_arg_1=0] [L318] EXPR var_68_arg_0 & var_68_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0] [L318] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L319] SORT_1 var_69_arg_0 = var_68; [L320] SORT_1 var_69 = ~var_69_arg_0; [L321] SORT_25 var_70_arg_0 = state_32; [L322] SORT_1 var_70 = var_70_arg_0 >> 1; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_69=-1, var_70=0] [L323] EXPR var_70 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_69=-1] [L323] var_70 = var_70 & mask_SORT_1 [L324] SORT_1 var_71_arg_0 = var_70; [L325] SORT_1 var_71_arg_1 = var_28; [L326] SORT_1 var_71 = var_71_arg_0 == var_71_arg_1; [L327] SORT_1 var_72_arg_0 = var_69; [L328] SORT_1 var_72_arg_1 = var_71; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_70=0, var_72_arg_0=-1, var_72_arg_1=0] [L329] EXPR var_72_arg_0 | var_72_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_54=255, var_66=0, var_70=0] [L329] SORT_1 var_72 = var_72_arg_0 | var_72_arg_1; [L330] SORT_1 var_73_arg_0 = var_54; [L331] SORT_1 var_73_arg_1 = var_72; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73_arg_0=255, var_73_arg_1=255] [L332] EXPR var_73_arg_0 & var_73_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0] [L332] SORT_1 var_73 = var_73_arg_0 & var_73_arg_1; [L333] SORT_3 var_75_arg_0 = state_74; [L334] SORT_3 var_75_arg_1 = var_14; [L335] SORT_1 var_75 = var_75_arg_0 >= var_75_arg_1; [L336] SORT_3 var_77_arg_0 = state_76; [L337] SORT_3 var_77_arg_1 = var_14; [L338] SORT_1 var_77 = var_77_arg_0 >= var_77_arg_1; [L339] SORT_1 var_78_arg_0 = var_75; [L340] SORT_1 var_78_arg_1 = var_77; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_78_arg_0=0, var_78_arg_1=0] [L341] EXPR var_78_arg_0 & var_78_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255] [L341] SORT_1 var_78 = var_78_arg_0 & var_78_arg_1; [L342] SORT_3 var_80_arg_0 = state_79; [L343] SORT_3 var_80_arg_1 = var_14; [L344] SORT_1 var_80 = var_80_arg_0 >= var_80_arg_1; [L345] SORT_1 var_81_arg_0 = var_78; [L346] SORT_1 var_81_arg_1 = var_80; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_81_arg_0=0, var_81_arg_1=0] [L347] EXPR var_81_arg_0 & var_81_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255] [L347] SORT_1 var_81 = var_81_arg_0 & var_81_arg_1; [L348] SORT_3 var_83_arg_0 = state_82; [L349] SORT_3 var_83_arg_1 = var_14; [L350] SORT_1 var_83 = var_83_arg_0 >= var_83_arg_1; [L351] SORT_1 var_84_arg_0 = var_81; [L352] SORT_1 var_84_arg_1 = var_83; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_84_arg_0=0, var_84_arg_1=0] [L353] EXPR var_84_arg_0 & var_84_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_26=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255] [L353] SORT_1 var_84 = var_84_arg_0 & var_84_arg_1; [L354] SORT_25 var_85_arg_0 = state_26; [L355] SORT_1 var_85 = var_85_arg_0 >> 0; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_84=0, var_85=0] [L356] EXPR var_85 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_84=0] [L356] var_85 = var_85 & mask_SORT_1 [L357] SORT_1 var_86_arg_0 = var_85; [L358] SORT_1 var_86_arg_1 = var_28; [L359] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L360] SORT_1 var_87_arg_0 = var_84; [L361] SORT_1 var_87_arg_1 = var_86; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_87_arg_0=0, var_87_arg_1=0] [L362] EXPR var_87_arg_0 & var_87_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0] [L362] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L363] SORT_1 var_88_arg_0 = var_87; [L364] SORT_1 var_88 = ~var_88_arg_0; [L365] SORT_25 var_89_arg_0 = state_32; [L366] SORT_1 var_89 = var_89_arg_0 >> 0; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_88=-1, var_89=0] [L367] EXPR var_89 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_88=-1] [L367] var_89 = var_89 & mask_SORT_1 [L368] SORT_1 var_90_arg_0 = var_89; [L369] SORT_1 var_90_arg_1 = var_28; [L370] SORT_1 var_90 = var_90_arg_0 == var_90_arg_1; [L371] SORT_1 var_91_arg_0 = var_88; [L372] SORT_1 var_91_arg_1 = var_90; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_89=0, var_91_arg_0=-1, var_91_arg_1=0] [L373] EXPR var_91_arg_0 | var_91_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_73=255, var_85=0, var_89=0] [L373] SORT_1 var_91 = var_91_arg_0 | var_91_arg_1; [L374] SORT_1 var_92_arg_0 = var_73; [L375] SORT_1 var_92_arg_1 = var_91; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92_arg_0=255, var_92_arg_1=255] [L376] EXPR var_92_arg_0 & var_92_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_13=0, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_16=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L376] SORT_1 var_92 = var_92_arg_0 & var_92_arg_1; [L377] SORT_3 var_93_arg_0 = state_13; [L378] SORT_3 var_93_arg_1 = var_14; [L379] SORT_1 var_93 = var_93_arg_0 >= var_93_arg_1; [L380] SORT_3 var_94_arg_0 = state_16; [L381] SORT_3 var_94_arg_1 = var_14; [L382] SORT_1 var_94 = var_94_arg_0 >= var_94_arg_1; [L383] SORT_1 var_95_arg_0 = var_93; [L384] SORT_1 var_95_arg_1 = var_94; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255, var_95_arg_0=0, var_95_arg_1=0] [L385] EXPR var_95_arg_0 | var_95_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_19=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L385] SORT_1 var_95 = var_95_arg_0 | var_95_arg_1; [L386] SORT_3 var_96_arg_0 = state_19; [L387] SORT_3 var_96_arg_1 = var_14; [L388] SORT_1 var_96 = var_96_arg_0 >= var_96_arg_1; [L389] SORT_1 var_97_arg_0 = var_95; [L390] SORT_1 var_97_arg_1 = var_96; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255, var_97_arg_0=0, var_97_arg_1=0] [L391] EXPR var_97_arg_0 | var_97_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_22=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L391] SORT_1 var_97 = var_97_arg_0 | var_97_arg_1; [L392] SORT_3 var_98_arg_0 = state_22; [L393] SORT_3 var_98_arg_1 = var_14; [L394] SORT_1 var_98 = var_98_arg_0 >= var_98_arg_1; [L395] SORT_1 var_99_arg_0 = var_97; [L396] SORT_1 var_99_arg_1 = var_98; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255, var_99_arg_0=0, var_99_arg_1=0] [L397] EXPR var_99_arg_0 | var_99_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_27=0, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L397] SORT_1 var_99 = var_99_arg_0 | var_99_arg_1; [L398] SORT_1 var_100_arg_0 = var_27; [L399] SORT_1 var_100_arg_1 = var_28; [L400] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L401] SORT_1 var_101_arg_0 = var_99; [L402] SORT_1 var_101_arg_1 = var_100; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_101_arg_0=0, var_101_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L403] EXPR var_101_arg_0 | var_101_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L403] SORT_1 var_101 = var_101_arg_0 | var_101_arg_1; [L404] SORT_1 var_102_arg_0 = var_33; [L405] SORT_1 var_102_arg_1 = var_11; [L406] SORT_1 var_102 = var_102_arg_0 == var_102_arg_1; [L407] SORT_1 var_103_arg_0 = var_101; [L408] SORT_1 var_103_arg_1 = var_102; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_103_arg_0=0, var_103_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L409] EXPR var_103_arg_0 | var_103_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0, var_92=255] [L409] SORT_1 var_103 = var_103_arg_0 | var_103_arg_1; [L410] SORT_1 var_104_arg_0 = var_92; [L411] SORT_1 var_104_arg_1 = var_103; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104_arg_0=255, var_104_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L412] EXPR var_104_arg_0 & var_104_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_36=0, state_38=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L412] SORT_1 var_104 = var_104_arg_0 & var_104_arg_1; [L413] SORT_3 var_105_arg_0 = state_36; [L414] SORT_3 var_105_arg_1 = var_14; [L415] SORT_1 var_105 = var_105_arg_0 >= var_105_arg_1; [L416] SORT_3 var_106_arg_0 = state_38; [L417] SORT_3 var_106_arg_1 = var_14; [L418] SORT_1 var_106 = var_106_arg_0 >= var_106_arg_1; [L419] SORT_1 var_107_arg_0 = var_105; [L420] SORT_1 var_107_arg_1 = var_106; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_107_arg_0=0, var_107_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L421] EXPR var_107_arg_0 | var_107_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_41=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L421] SORT_1 var_107 = var_107_arg_0 | var_107_arg_1; [L422] SORT_3 var_108_arg_0 = state_41; [L423] SORT_3 var_108_arg_1 = var_14; [L424] SORT_1 var_108 = var_108_arg_0 >= var_108_arg_1; [L425] SORT_1 var_109_arg_0 = var_107; [L426] SORT_1 var_109_arg_1 = var_108; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_109_arg_0=0, var_109_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L427] EXPR var_109_arg_0 | var_109_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_44=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L427] SORT_1 var_109 = var_109_arg_0 | var_109_arg_1; [L428] SORT_3 var_110_arg_0 = state_44; [L429] SORT_3 var_110_arg_1 = var_14; [L430] SORT_1 var_110 = var_110_arg_0 >= var_110_arg_1; [L431] SORT_1 var_111_arg_0 = var_109; [L432] SORT_1 var_111_arg_1 = var_110; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_111_arg_0=0, var_111_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L433] EXPR var_111_arg_0 | var_111_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_47=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L433] SORT_1 var_111 = var_111_arg_0 | var_111_arg_1; [L434] SORT_1 var_112_arg_0 = var_47; [L435] SORT_1 var_112_arg_1 = var_28; [L436] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L437] SORT_1 var_113_arg_0 = var_111; [L438] SORT_1 var_113_arg_1 = var_112; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_113_arg_0=0, var_113_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L439] EXPR var_113_arg_0 | var_113_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L439] SORT_1 var_113 = var_113_arg_0 | var_113_arg_1; [L440] SORT_1 var_114_arg_0 = var_51; [L441] SORT_1 var_114_arg_1 = var_11; [L442] SORT_1 var_114 = var_114_arg_0 == var_114_arg_1; [L443] SORT_1 var_115_arg_0 = var_113; [L444] SORT_1 var_115_arg_1 = var_114; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_115_arg_0=0, var_115_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L445] EXPR var_115_arg_0 | var_115_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_104=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L445] SORT_1 var_115 = var_115_arg_0 | var_115_arg_1; [L446] SORT_1 var_116_arg_0 = var_104; [L447] SORT_1 var_116_arg_1 = var_115; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116_arg_0=0, var_116_arg_1=1, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L448] EXPR var_116_arg_0 & var_116_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_55=0, state_57=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L448] SORT_1 var_116 = var_116_arg_0 & var_116_arg_1; [L449] SORT_3 var_117_arg_0 = state_55; [L450] SORT_3 var_117_arg_1 = var_14; [L451] SORT_1 var_117 = var_117_arg_0 >= var_117_arg_1; [L452] SORT_3 var_118_arg_0 = state_57; [L453] SORT_3 var_118_arg_1 = var_14; [L454] SORT_1 var_118 = var_118_arg_0 >= var_118_arg_1; [L455] SORT_1 var_119_arg_0 = var_117; [L456] SORT_1 var_119_arg_1 = var_118; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_119_arg_0=0, var_119_arg_1=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L457] EXPR var_119_arg_0 | var_119_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_60=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L457] SORT_1 var_119 = var_119_arg_0 | var_119_arg_1; [L458] SORT_3 var_120_arg_0 = state_60; [L459] SORT_3 var_120_arg_1 = var_14; [L460] SORT_1 var_120 = var_120_arg_0 >= var_120_arg_1; [L461] SORT_1 var_121_arg_0 = var_119; [L462] SORT_1 var_121_arg_1 = var_120; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_121_arg_0=0, var_121_arg_1=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L463] EXPR var_121_arg_0 | var_121_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_63=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L463] SORT_1 var_121 = var_121_arg_0 | var_121_arg_1; [L464] SORT_3 var_122_arg_0 = state_63; [L465] SORT_3 var_122_arg_1 = var_14; [L466] SORT_1 var_122 = var_122_arg_0 >= var_122_arg_1; [L467] SORT_1 var_123_arg_0 = var_121; [L468] SORT_1 var_123_arg_1 = var_122; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_123_arg_0=0, var_123_arg_1=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L469] EXPR var_123_arg_0 | var_123_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_66=0, var_70=0, var_85=0, var_89=0] [L469] SORT_1 var_123 = var_123_arg_0 | var_123_arg_1; [L470] SORT_1 var_124_arg_0 = var_66; [L471] SORT_1 var_124_arg_1 = var_28; [L472] SORT_1 var_124 = var_124_arg_0 == var_124_arg_1; [L473] SORT_1 var_125_arg_0 = var_123; [L474] SORT_1 var_125_arg_1 = var_124; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_125_arg_0=0, var_125_arg_1=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L475] EXPR var_125_arg_0 | var_125_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L475] SORT_1 var_125 = var_125_arg_0 | var_125_arg_1; [L476] SORT_1 var_126_arg_0 = var_70; [L477] SORT_1 var_126_arg_1 = var_11; [L478] SORT_1 var_126 = var_126_arg_0 == var_126_arg_1; [L479] SORT_1 var_127_arg_0 = var_125; [L480] SORT_1 var_127_arg_1 = var_126; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_127_arg_0=0, var_127_arg_1=1, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L481] EXPR var_127_arg_0 | var_127_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_116=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L481] SORT_1 var_127 = var_127_arg_0 | var_127_arg_1; [L482] SORT_1 var_128_arg_0 = var_116; [L483] SORT_1 var_128_arg_1 = var_127; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_128_arg_0=0, var_128_arg_1=1, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L484] EXPR var_128_arg_0 & var_128_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_74=0, state_76=0, state_79=0, state_82=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L484] SORT_1 var_128 = var_128_arg_0 & var_128_arg_1; [L485] SORT_3 var_129_arg_0 = state_74; [L486] SORT_3 var_129_arg_1 = var_14; [L487] SORT_1 var_129 = var_129_arg_0 >= var_129_arg_1; [L488] SORT_3 var_130_arg_0 = state_76; [L489] SORT_3 var_130_arg_1 = var_14; [L490] SORT_1 var_130 = var_130_arg_0 >= var_130_arg_1; [L491] SORT_1 var_131_arg_0 = var_129; [L492] SORT_1 var_131_arg_1 = var_130; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_79=0, state_82=0, var_11=0, var_128=0, var_12=1, var_131_arg_0=0, var_131_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L493] EXPR var_131_arg_0 | var_131_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_79=0, state_82=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L493] SORT_1 var_131 = var_131_arg_0 | var_131_arg_1; [L494] SORT_3 var_132_arg_0 = state_79; [L495] SORT_3 var_132_arg_1 = var_14; [L496] SORT_1 var_132 = var_132_arg_0 >= var_132_arg_1; [L497] SORT_1 var_133_arg_0 = var_131; [L498] SORT_1 var_133_arg_1 = var_132; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_82=0, var_11=0, var_128=0, var_12=1, var_133_arg_0=0, var_133_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L499] EXPR var_133_arg_0 | var_133_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, state_82=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L499] SORT_1 var_133 = var_133_arg_0 | var_133_arg_1; [L500] SORT_3 var_134_arg_0 = state_82; [L501] SORT_3 var_134_arg_1 = var_14; [L502] SORT_1 var_134 = var_134_arg_0 >= var_134_arg_1; [L503] SORT_1 var_135_arg_0 = var_133; [L504] SORT_1 var_135_arg_1 = var_134; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_135_arg_0=0, var_135_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L505] EXPR var_135_arg_0 | var_135_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_85=0, var_89=0] [L505] SORT_1 var_135 = var_135_arg_0 | var_135_arg_1; [L506] SORT_1 var_136_arg_0 = var_85; [L507] SORT_1 var_136_arg_1 = var_28; [L508] SORT_1 var_136 = var_136_arg_0 == var_136_arg_1; [L509] SORT_1 var_137_arg_0 = var_135; [L510] SORT_1 var_137_arg_1 = var_136; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_137_arg_0=0, var_137_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L511] EXPR var_137_arg_0 | var_137_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L511] SORT_1 var_137 = var_137_arg_0 | var_137_arg_1; [L512] SORT_1 var_138_arg_0 = var_89; [L513] SORT_1 var_138_arg_1 = var_11; [L514] SORT_1 var_138 = var_138_arg_0 == var_138_arg_1; [L515] SORT_1 var_139_arg_0 = var_137; [L516] SORT_1 var_139_arg_1 = var_138; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_139_arg_0=0, var_139_arg_1=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L517] EXPR var_139_arg_0 | var_139_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_128=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L517] SORT_1 var_139 = var_139_arg_0 | var_139_arg_1; [L518] SORT_1 var_140_arg_0 = var_128; [L519] SORT_1 var_140_arg_1 = var_139; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_12=1, var_140_arg_0=0, var_140_arg_1=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L520] EXPR var_140_arg_0 & var_140_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_12=1, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L520] SORT_1 var_140 = var_140_arg_0 & var_140_arg_1; [L521] SORT_1 var_141_arg_0 = var_12; [L522] SORT_1 var_141_arg_1 = var_140; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_141_arg_0=1, var_141_arg_1=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L523] EXPR var_141_arg_0 | var_141_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L523] SORT_1 var_141 = var_141_arg_0 | var_141_arg_1; [L524] SORT_1 var_144_arg_0 = var_141; [L525] SORT_1 var_144 = ~var_144_arg_0; [L526] SORT_1 var_145_arg_0 = var_28; [L527] SORT_1 var_145_arg_1 = var_144; VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_145_arg_0=1, var_145_arg_1=-2, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L528] EXPR var_145_arg_0 & var_145_arg_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L528] SORT_1 var_145 = var_145_arg_0 & var_145_arg_1; [L529] EXPR var_145 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_195=7, mask_SORT_1=1, mask_SORT_3=3, state_148=0, state_149=0, state_150=0, state_151=0, state_152=0, state_153=0, state_154=0, state_155=0, state_156=0, state_157=0, state_158=0, state_159=0, state_160=0, state_161=0, state_162=0, state_163=0, state_32=0, var_11=0, var_14=2, var_189=1, var_274=0, var_275=3, var_284=0, var_28=1, var_33=0, var_495=2, var_51=0, var_70=0, var_89=0] [L529] var_145 = var_145 & mask_SORT_1 [L530] SORT_1 bad_146_arg_0 = var_145; [L531] CALL __VERIFIER_assert(!(bad_146_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1152 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.0s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46327 SdHoareTripleChecker+Valid, 37.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46327 mSDsluCounter, 375852 SdHoareTripleChecker+Invalid, 31.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300422 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90990 IncrementalHoareTripleChecker+Invalid, 91023 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 75430 mSDtfsCounter, 90990 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30649occurred in iteration=53, InterpolantAutomatonStates: 343, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 53 MinimizatonAttempts, 50262 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 10952 NumberOfCodeBlocks, 10952 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 10692 ConstructedInterpolants, 0 QuantifiedInterpolants, 27326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 0/0 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-02-08 00:14:16,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...