./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_p3.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 404ac2bd3423bef5ce605181ef24be34b1a7af016e0b24dd5c9fcdb327055474 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:20:09,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:20:09,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:20:09,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:20:09,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:20:09,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:20:09,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:20:09,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:20:09,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:20:09,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:20:09,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:20:09,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:20:09,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:20:09,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:20:09,374 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:20:09,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:20:09,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:20:09,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:09,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:09,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:20:09,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:20:09,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:20:09,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:20:09,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:09,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:20:09,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:20:09,377 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 -> 404ac2bd3423bef5ce605181ef24be34b1a7af016e0b24dd5c9fcdb327055474 [2025-01-09 08:20:09,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:20:09,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:20:09,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:20:09,605 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:20:09,605 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:20:09,607 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_p3.c [2025-01-09 08:20:10,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d18fc8efc/31cab3d6a32840bc870a67ffb148999d/FLAG2915d7278 [2025-01-09 08:20:11,221 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:20:11,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p3.c [2025-01-09 08:20:11,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d18fc8efc/31cab3d6a32840bc870a67ffb148999d/FLAG2915d7278 [2025-01-09 08:20:11,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d18fc8efc/31cab3d6a32840bc870a67ffb148999d [2025-01-09 08:20:11,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:20:11,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:20:11,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:11,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:20:11,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:20:11,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:11" (1/1) ... [2025-01-09 08:20:11,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69faa6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:11, skipping insertion in model container [2025-01-09 08:20:11,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:20:11" (1/1) ... [2025-01-09 08:20:11,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:20:11,546 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_p3.c[1258,1271] [2025-01-09 08:20:11,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:11,866 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:20:11,873 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_p3.c[1258,1271] [2025-01-09 08:20:12,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:20:12,062 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:20:12,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12 WrapperNode [2025-01-09 08:20:12,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:20:12,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:12,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:20:12,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:20:12,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:12,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:12,494 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4446 [2025-01-09 08:20:12,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:20:12,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:20:12,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:20:12,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:20:12,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:12,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:12,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:12,806 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-01-09 08:20:12,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:12,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:12,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:13,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:13,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:13,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:13,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:13,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:20:13,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:20:13,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:20:13,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:20:13,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (1/1) ... [2025-01-09 08:20:13,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:20:13,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:13,204 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-01-09 08:20:13,207 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-01-09 08:20:13,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:20:13,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:20:13,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:20:13,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:20:13,599 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:20:13,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:20:16,449 INFO L? ?]: Removed 2795 outVars from TransFormulas that were not future-live. [2025-01-09 08:20:16,450 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:20:16,476 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:20:16,481 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:20:16,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:16 BoogieIcfgContainer [2025-01-09 08:20:16,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:20:16,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:20:16,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:20:16,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:20:16,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:20:11" (1/3) ... [2025-01-09 08:20:16,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7e04b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:16, skipping insertion in model container [2025-01-09 08:20:16,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:20:12" (2/3) ... [2025-01-09 08:20:16,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7e04b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:20:16, skipping insertion in model container [2025-01-09 08:20:16,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:16" (3/3) ... [2025-01-09 08:20:16,496 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p3.c [2025-01-09 08:20:16,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:20:16,520 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_bpbs_p3.c that has 1 procedures, 1094 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:20:16,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:20:16,633 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;@99cfa56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:20:16,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:20:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 1094 states, 1092 states have (on average 1.499084249084249) internal successors, (1637), 1093 states have internal predecessors, (1637), 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-01-09 08:20:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 08:20:16,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:16,665 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] [2025-01-09 08:20:16,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:16,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1201674155, now seen corresponding path program 1 times [2025-01-09 08:20:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012226998] [2025-01-09 08:20:16,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:16,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 08:20:17,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 08:20:17,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012226998] [2025-01-09 08:20:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012226998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882897598] [2025-01-09 08:20:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:18,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:18,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:18,020 INFO L87 Difference]: Start difference. First operand has 1094 states, 1092 states have (on average 1.499084249084249) internal successors, (1637), 1093 states have internal predecessors, (1637), 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 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-01-09 08:20:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:18,164 INFO L93 Difference]: Finished difference Result 2049 states and 3069 transitions. [2025-01-09 08:20:18,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 169 [2025-01-09 08:20:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:18,186 INFO L225 Difference]: With dead ends: 2049 [2025-01-09 08:20:18,186 INFO L226 Difference]: Without dead ends: 1093 [2025-01-09 08:20:18,193 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-01-09 08:20:18,198 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4887 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:18,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4887 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2025-01-09 08:20:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2025-01-09 08:20:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 1.4972527472527473) internal successors, (1635), 1092 states have internal predecessors, (1635), 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-01-09 08:20:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1635 transitions. [2025-01-09 08:20:18,284 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1635 transitions. Word has length 169 [2025-01-09 08:20:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1635 transitions. [2025-01-09 08:20:18,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-01-09 08:20:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1635 transitions. [2025-01-09 08:20:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 08:20:18,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:18,291 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] [2025-01-09 08:20:18,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:20:18,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:18,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1401110640, now seen corresponding path program 1 times [2025-01-09 08:20:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640881449] [2025-01-09 08:20:18,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:18,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 08:20:18,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 08:20:18,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:18,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640881449] [2025-01-09 08:20:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640881449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:18,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:18,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412141524] [2025-01-09 08:20:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:18,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:18,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:18,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:18,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:18,822 INFO L87 Difference]: Start difference. First operand 1093 states and 1635 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-01-09 08:20:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:18,885 INFO L93 Difference]: Finished difference Result 2050 states and 3067 transitions. [2025-01-09 08:20:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:18,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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 170 [2025-01-09 08:20:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:18,892 INFO L225 Difference]: With dead ends: 2050 [2025-01-09 08:20:18,892 INFO L226 Difference]: Without dead ends: 1095 [2025-01-09 08:20:18,893 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-01-09 08:20:18,895 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:18,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-01-09 08:20:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2025-01-09 08:20:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1094 states have (on average 1.4963436928702012) internal successors, (1637), 1094 states have internal predecessors, (1637), 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-01-09 08:20:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1637 transitions. [2025-01-09 08:20:18,933 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1637 transitions. Word has length 170 [2025-01-09 08:20:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:18,934 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1637 transitions. [2025-01-09 08:20:18,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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-01-09 08:20:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1637 transitions. [2025-01-09 08:20:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 08:20:18,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:18,935 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] [2025-01-09 08:20:18,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:20:18,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:18,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1582721756, now seen corresponding path program 1 times [2025-01-09 08:20:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:18,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191008595] [2025-01-09 08:20:18,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:18,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 08:20:19,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 08:20:19,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:19,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191008595] [2025-01-09 08:20:19,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191008595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:19,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855640019] [2025-01-09 08:20:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:19,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:19,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:19,954 INFO L87 Difference]: Start difference. First operand 1095 states and 1637 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-01-09 08:20:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:20,124 INFO L93 Difference]: Finished difference Result 2060 states and 3080 transitions. [2025-01-09 08:20:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:20,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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 171 [2025-01-09 08:20:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:20,129 INFO L225 Difference]: With dead ends: 2060 [2025-01-09 08:20:20,129 INFO L226 Difference]: Without dead ends: 1103 [2025-01-09 08:20:20,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 08:20:20,135 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1562 mSDsluCounter, 4810 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 6416 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:20,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 6416 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-01-09 08:20:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1100. [2025-01-09 08:20:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1099 states have (on average 1.4949954504094631) internal successors, (1643), 1099 states have internal predecessors, (1643), 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-01-09 08:20:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1643 transitions. [2025-01-09 08:20:20,156 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1643 transitions. Word has length 171 [2025-01-09 08:20:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:20,156 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1643 transitions. [2025-01-09 08:20:20,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-01-09 08:20:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1643 transitions. [2025-01-09 08:20:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 08:20:20,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:20,158 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] [2025-01-09 08:20:20,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:20:20,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:20,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1370628648, now seen corresponding path program 1 times [2025-01-09 08:20:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544925364] [2025-01-09 08:20:20,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:20,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 08:20:20,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 08:20:20,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:20,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:21,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-01-09 08:20:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:21,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544925364] [2025-01-09 08:20:21,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544925364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:21,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:21,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497209245] [2025-01-09 08:20:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:21,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:21,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:21,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:21,091 INFO L87 Difference]: Start difference. First operand 1100 states and 1643 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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-01-09 08:20:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:21,161 INFO L93 Difference]: Finished difference Result 2070 states and 3092 transitions. [2025-01-09 08:20:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:21,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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 172 [2025-01-09 08:20:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:21,166 INFO L225 Difference]: With dead ends: 2070 [2025-01-09 08:20:21,166 INFO L226 Difference]: Without dead ends: 1108 [2025-01-09 08:20:21,167 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-01-09 08:20:21,168 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 6 mSDsluCounter, 4872 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6499 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:21,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6499 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-01-09 08:20:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1106. [2025-01-09 08:20:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.4941176470588236) internal successors, (1651), 1105 states have internal predecessors, (1651), 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-01-09 08:20:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1651 transitions. [2025-01-09 08:20:21,186 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1651 transitions. Word has length 172 [2025-01-09 08:20:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:21,187 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1651 transitions. [2025-01-09 08:20:21,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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-01-09 08:20:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1651 transitions. [2025-01-09 08:20:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 08:20:21,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:21,188 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] [2025-01-09 08:20:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:20:21,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1258411433, now seen corresponding path program 1 times [2025-01-09 08:20:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668593959] [2025-01-09 08:20:21,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:21,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 08:20:21,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 08:20:21,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668593959] [2025-01-09 08:20:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668593959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32779232] [2025-01-09 08:20:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:22,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:22,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:22,089 INFO L87 Difference]: Start difference. First operand 1106 states and 1651 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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-01-09 08:20:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:22,255 INFO L93 Difference]: Finished difference Result 2082 states and 3108 transitions. [2025-01-09 08:20:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:22,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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 173 [2025-01-09 08:20:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:22,259 INFO L225 Difference]: With dead ends: 2082 [2025-01-09 08:20:22,259 INFO L226 Difference]: Without dead ends: 1114 [2025-01-09 08:20:22,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 08:20:22,262 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1555 mSDsluCounter, 6408 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 8014 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:22,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 8014 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-01-09 08:20:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1111. [2025-01-09 08:20:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1110 states have (on average 1.4927927927927929) internal successors, (1657), 1110 states have internal predecessors, (1657), 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-01-09 08:20:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1657 transitions. [2025-01-09 08:20:22,281 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1657 transitions. Word has length 173 [2025-01-09 08:20:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:22,281 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1657 transitions. [2025-01-09 08:20:22,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 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-01-09 08:20:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1657 transitions. [2025-01-09 08:20:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 08:20:22,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:22,286 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] [2025-01-09 08:20:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:20:22,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:22,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1208502494, now seen corresponding path program 1 times [2025-01-09 08:20:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465967732] [2025-01-09 08:20:22,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:22,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 08:20:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 08:20:22,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:22,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465967732] [2025-01-09 08:20:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465967732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:22,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:22,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576691423] [2025-01-09 08:20:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:22,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:22,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:22,805 INFO L87 Difference]: Start difference. First operand 1111 states and 1657 transitions. Second operand has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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-01-09 08:20:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:22,880 INFO L93 Difference]: Finished difference Result 2114 states and 3151 transitions. [2025-01-09 08:20:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:22,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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 174 [2025-01-09 08:20:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:22,884 INFO L225 Difference]: With dead ends: 2114 [2025-01-09 08:20:22,884 INFO L226 Difference]: Without dead ends: 1141 [2025-01-09 08:20:22,885 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-01-09 08:20:22,886 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 23 mSDsluCounter, 6530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8153 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:22,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 8153 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-01-09 08:20:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1137. [2025-01-09 08:20:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.4911971830985915) internal successors, (1694), 1136 states have internal predecessors, (1694), 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-01-09 08:20:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1694 transitions. [2025-01-09 08:20:22,902 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1694 transitions. Word has length 174 [2025-01-09 08:20:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:22,902 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1694 transitions. [2025-01-09 08:20:22,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 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-01-09 08:20:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1694 transitions. [2025-01-09 08:20:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 08:20:22,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:22,904 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] [2025-01-09 08:20:22,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:20:22,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash -914422153, now seen corresponding path program 1 times [2025-01-09 08:20:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273223921] [2025-01-09 08:20:22,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:22,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 08:20:23,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 08:20:23,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:23,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273223921] [2025-01-09 08:20:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273223921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:20:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371279733] [2025-01-09 08:20:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:20:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:23,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:20:23,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:23,577 INFO L87 Difference]: Start difference. First operand 1137 states and 1694 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 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-01-09 08:20:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:23,706 INFO L93 Difference]: Finished difference Result 2150 states and 3201 transitions. [2025-01-09 08:20:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:20:23,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 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 174 [2025-01-09 08:20:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:23,710 INFO L225 Difference]: With dead ends: 2150 [2025-01-09 08:20:23,710 INFO L226 Difference]: Without dead ends: 1151 [2025-01-09 08:20:23,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:23,712 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 33 mSDsluCounter, 11345 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 12964 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:23,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 12964 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-01-09 08:20:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1141. [2025-01-09 08:20:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.4912280701754386) internal successors, (1700), 1140 states have internal predecessors, (1700), 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-01-09 08:20:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1700 transitions. [2025-01-09 08:20:23,730 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1700 transitions. Word has length 174 [2025-01-09 08:20:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:23,730 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1700 transitions. [2025-01-09 08:20:23,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 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-01-09 08:20:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1700 transitions. [2025-01-09 08:20:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 08:20:23,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:23,731 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] [2025-01-09 08:20:23,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:20:23,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:23,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash -935542320, now seen corresponding path program 1 times [2025-01-09 08:20:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132258833] [2025-01-09 08:20:23,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:23,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 08:20:23,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 08:20:23,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132258833] [2025-01-09 08:20:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132258833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615226875] [2025-01-09 08:20:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:23,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:23,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:23,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:23,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:23,995 INFO L87 Difference]: Start difference. First operand 1141 states and 1700 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-09 08:20:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:24,044 INFO L93 Difference]: Finished difference Result 2148 states and 3200 transitions. [2025-01-09 08:20:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:24,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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 174 [2025-01-09 08:20:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:24,048 INFO L225 Difference]: With dead ends: 2148 [2025-01-09 08:20:24,048 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 08:20:24,049 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-01-09 08:20:24,050 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6508 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:24,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6508 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 08:20:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2025-01-09 08:20:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 1.4895104895104896) internal successors, (1704), 1144 states have internal predecessors, (1704), 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-01-09 08:20:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1704 transitions. [2025-01-09 08:20:24,066 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1704 transitions. Word has length 174 [2025-01-09 08:20:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:24,066 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1704 transitions. [2025-01-09 08:20:24,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-09 08:20:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1704 transitions. [2025-01-09 08:20:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 08:20:24,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:24,068 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] [2025-01-09 08:20:24,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:20:24,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 555041189, now seen corresponding path program 1 times [2025-01-09 08:20:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961972897] [2025-01-09 08:20:24,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:24,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 08:20:24,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 08:20:24,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:24,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961972897] [2025-01-09 08:20:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961972897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057492096] [2025-01-09 08:20:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:24,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:24,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:24,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:24,601 INFO L87 Difference]: Start difference. First operand 1145 states and 1704 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-09 08:20:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:24,664 INFO L93 Difference]: Finished difference Result 2158 states and 3211 transitions. [2025-01-09 08:20:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:24,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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 174 [2025-01-09 08:20:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:24,668 INFO L225 Difference]: With dead ends: 2158 [2025-01-09 08:20:24,668 INFO L226 Difference]: Without dead ends: 1151 [2025-01-09 08:20:24,669 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-01-09 08:20:24,672 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 5 mSDsluCounter, 4872 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6499 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:24,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6499 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-01-09 08:20:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1149. [2025-01-09 08:20:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.4886759581881532) internal successors, (1709), 1148 states have internal predecessors, (1709), 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-01-09 08:20:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1709 transitions. [2025-01-09 08:20:24,695 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1709 transitions. Word has length 174 [2025-01-09 08:20:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:24,695 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1709 transitions. [2025-01-09 08:20:24,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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-01-09 08:20:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1709 transitions. [2025-01-09 08:20:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 08:20:24,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:24,697 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] [2025-01-09 08:20:24,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:20:24,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:24,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash -356047700, now seen corresponding path program 1 times [2025-01-09 08:20:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179239312] [2025-01-09 08:20:24,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:24,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 08:20:24,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 08:20:24,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:24,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:24,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:24,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179239312] [2025-01-09 08:20:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179239312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:24,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604473770] [2025-01-09 08:20:24,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:24,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:24,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:24,986 INFO L87 Difference]: Start difference. First operand 1149 states and 1709 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-01-09 08:20:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:25,024 INFO L93 Difference]: Finished difference Result 2162 states and 3215 transitions. [2025-01-09 08:20:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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 174 [2025-01-09 08:20:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:25,028 INFO L225 Difference]: With dead ends: 2162 [2025-01-09 08:20:25,028 INFO L226 Difference]: Without dead ends: 1151 [2025-01-09 08:20:25,029 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-01-09 08:20:25,030 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:25,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-01-09 08:20:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2025-01-09 08:20:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 1.4878260869565216) internal successors, (1711), 1150 states have internal predecessors, (1711), 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-01-09 08:20:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1711 transitions. [2025-01-09 08:20:25,049 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1711 transitions. Word has length 174 [2025-01-09 08:20:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:25,050 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1711 transitions. [2025-01-09 08:20:25,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-01-09 08:20:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1711 transitions. [2025-01-09 08:20:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:20:25,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:25,051 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] [2025-01-09 08:20:25,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:20:25,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:25,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash -13194402, now seen corresponding path program 1 times [2025-01-09 08:20:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268922490] [2025-01-09 08:20:25,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:25,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:20:25,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:20:25,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:25,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:25,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:25,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268922490] [2025-01-09 08:20:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268922490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:25,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:25,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937478911] [2025-01-09 08:20:25,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:25,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:25,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:25,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:25,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:25,535 INFO L87 Difference]: Start difference. First operand 1151 states and 1711 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 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-01-09 08:20:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:25,627 INFO L93 Difference]: Finished difference Result 2195 states and 3261 transitions. [2025-01-09 08:20:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 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 175 [2025-01-09 08:20:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:25,631 INFO L225 Difference]: With dead ends: 2195 [2025-01-09 08:20:25,631 INFO L226 Difference]: Without dead ends: 1182 [2025-01-09 08:20:25,632 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-01-09 08:20:25,633 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 22 mSDsluCounter, 9714 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11336 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:25,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11336 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-01-09 08:20:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1178. [2025-01-09 08:20:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1177 states have (on average 1.4868309260832626) internal successors, (1750), 1177 states have internal predecessors, (1750), 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-01-09 08:20:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1750 transitions. [2025-01-09 08:20:25,649 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1750 transitions. Word has length 175 [2025-01-09 08:20:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:25,650 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1750 transitions. [2025-01-09 08:20:25,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 states have internal predecessors, (175), 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-01-09 08:20:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1750 transitions. [2025-01-09 08:20:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:20:25,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:25,651 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] [2025-01-09 08:20:25,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:20:25,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:25,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1530302764, now seen corresponding path program 1 times [2025-01-09 08:20:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053079579] [2025-01-09 08:20:25,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:25,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:20:25,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:20:25,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:25,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:25,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:25,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053079579] [2025-01-09 08:20:25,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053079579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:25,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:25,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095525972] [2025-01-09 08:20:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:25,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:25,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:25,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:25,909 INFO L87 Difference]: Start difference. First operand 1178 states and 1750 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-01-09 08:20:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:25,942 INFO L93 Difference]: Finished difference Result 2222 states and 3300 transitions. [2025-01-09 08:20:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:25,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 175 [2025-01-09 08:20:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:25,946 INFO L225 Difference]: With dead ends: 2222 [2025-01-09 08:20:25,946 INFO L226 Difference]: Without dead ends: 1182 [2025-01-09 08:20:25,947 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-01-09 08:20:25,947 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:25,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-01-09 08:20:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2025-01-09 08:20:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.4851820491109229) internal successors, (1754), 1181 states have internal predecessors, (1754), 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-01-09 08:20:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1754 transitions. [2025-01-09 08:20:25,963 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1754 transitions. Word has length 175 [2025-01-09 08:20:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:25,964 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1754 transitions. [2025-01-09 08:20:25,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-01-09 08:20:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1754 transitions. [2025-01-09 08:20:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:20:25,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:25,965 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] [2025-01-09 08:20:25,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:20:25,966 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:25,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1642204290, now seen corresponding path program 1 times [2025-01-09 08:20:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542533258] [2025-01-09 08:20:25,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:26,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:20:26,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:20:26,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:26,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542533258] [2025-01-09 08:20:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542533258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:26,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:26,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:26,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587923473] [2025-01-09 08:20:26,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:26,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:26,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:26,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:26,180 INFO L87 Difference]: Start difference. First operand 1182 states and 1754 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-01-09 08:20:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:26,211 INFO L93 Difference]: Finished difference Result 2230 states and 3308 transitions. [2025-01-09 08:20:26,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 175 [2025-01-09 08:20:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:26,215 INFO L225 Difference]: With dead ends: 2230 [2025-01-09 08:20:26,215 INFO L226 Difference]: Without dead ends: 1186 [2025-01-09 08:20:26,216 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-01-09 08:20:26,217 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:26,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-01-09 08:20:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2025-01-09 08:20:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 1.4835443037974683) internal successors, (1758), 1185 states have internal predecessors, (1758), 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-01-09 08:20:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1758 transitions. [2025-01-09 08:20:26,234 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1758 transitions. Word has length 175 [2025-01-09 08:20:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:26,235 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1758 transitions. [2025-01-09 08:20:26,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-01-09 08:20:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1758 transitions. [2025-01-09 08:20:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:20:26,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:26,237 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] [2025-01-09 08:20:26,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:20:26,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:26,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1188582067, now seen corresponding path program 1 times [2025-01-09 08:20:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:26,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813078747] [2025-01-09 08:20:26,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:26,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:20:26,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:20:26,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:26,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:26,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813078747] [2025-01-09 08:20:26,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813078747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:26,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:26,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250795757] [2025-01-09 08:20:26,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:26,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:26,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:26,479 INFO L87 Difference]: Start difference. First operand 1186 states and 1758 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 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-01-09 08:20:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:26,515 INFO L93 Difference]: Finished difference Result 2236 states and 3313 transitions. [2025-01-09 08:20:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 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 175 [2025-01-09 08:20:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:26,519 INFO L225 Difference]: With dead ends: 2236 [2025-01-09 08:20:26,519 INFO L226 Difference]: Without dead ends: 1188 [2025-01-09 08:20:26,520 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-01-09 08:20:26,520 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:26,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-01-09 08:20:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2025-01-09 08:20:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 1.4827295703454086) internal successors, (1760), 1187 states have internal predecessors, (1760), 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-01-09 08:20:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1760 transitions. [2025-01-09 08:20:26,535 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1760 transitions. Word has length 175 [2025-01-09 08:20:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:26,536 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1760 transitions. [2025-01-09 08:20:26,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 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-01-09 08:20:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1760 transitions. [2025-01-09 08:20:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:20:26,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:26,538 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] [2025-01-09 08:20:26,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:20:26,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:26,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1387465769, now seen corresponding path program 1 times [2025-01-09 08:20:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:26,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871755243] [2025-01-09 08:20:26,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:26,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:20:26,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:20:26,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:26,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:26,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871755243] [2025-01-09 08:20:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871755243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827658879] [2025-01-09 08:20:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:26,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:26,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:26,978 INFO L87 Difference]: Start difference. First operand 1188 states and 1760 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 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-01-09 08:20:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:27,091 INFO L93 Difference]: Finished difference Result 2533 states and 3739 transitions. [2025-01-09 08:20:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 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 176 [2025-01-09 08:20:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:27,095 INFO L225 Difference]: With dead ends: 2533 [2025-01-09 08:20:27,095 INFO L226 Difference]: Without dead ends: 1483 [2025-01-09 08:20:27,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 08:20:27,097 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 1880 mSDsluCounter, 4810 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 6417 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:27,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 6417 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2025-01-09 08:20:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1342. [2025-01-09 08:20:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1341 states have (on average 1.4794929157345265) internal successors, (1984), 1341 states have internal predecessors, (1984), 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-01-09 08:20:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1984 transitions. [2025-01-09 08:20:27,117 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1984 transitions. Word has length 176 [2025-01-09 08:20:27,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:27,118 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1984 transitions. [2025-01-09 08:20:27,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 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-01-09 08:20:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1984 transitions. [2025-01-09 08:20:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:20:27,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:27,119 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] [2025-01-09 08:20:27,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:20:27,120 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:27,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash 270001242, now seen corresponding path program 1 times [2025-01-09 08:20:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:27,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671024023] [2025-01-09 08:20:27,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:27,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:20:27,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:20:27,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:27,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:27,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:27,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671024023] [2025-01-09 08:20:27,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671024023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:27,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:27,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:20:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439052223] [2025-01-09 08:20:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:20:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:27,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:20:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:27,861 INFO L87 Difference]: Start difference. First operand 1342 states and 1984 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-01-09 08:20:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:27,968 INFO L93 Difference]: Finished difference Result 2425 states and 3587 transitions. [2025-01-09 08:20:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:20:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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 176 [2025-01-09 08:20:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:27,972 INFO L225 Difference]: With dead ends: 2425 [2025-01-09 08:20:27,972 INFO L226 Difference]: Without dead ends: 1375 [2025-01-09 08:20:27,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:20:27,975 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 41 mSDsluCounter, 6555 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8173 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:27,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8173 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-01-09 08:20:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1361. [2025-01-09 08:20:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 1.4794117647058824) internal successors, (2012), 1360 states have internal predecessors, (2012), 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-01-09 08:20:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2012 transitions. [2025-01-09 08:20:27,996 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2012 transitions. Word has length 176 [2025-01-09 08:20:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:27,997 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 2012 transitions. [2025-01-09 08:20:27,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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-01-09 08:20:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2012 transitions. [2025-01-09 08:20:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 08:20:27,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:27,998 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] [2025-01-09 08:20:27,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:20:27,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:28,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash -157720514, now seen corresponding path program 1 times [2025-01-09 08:20:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954578387] [2025-01-09 08:20:28,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:28,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 08:20:28,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 08:20:28,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:28,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:28,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:28,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954578387] [2025-01-09 08:20:28,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954578387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:28,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:28,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105430371] [2025-01-09 08:20:28,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:28,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:28,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:28,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:28,447 INFO L87 Difference]: Start difference. First operand 1361 states and 2012 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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-01-09 08:20:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:28,495 INFO L93 Difference]: Finished difference Result 2438 states and 3606 transitions. [2025-01-09 08:20:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:28,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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 176 [2025-01-09 08:20:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:28,499 INFO L225 Difference]: With dead ends: 2438 [2025-01-09 08:20:28,499 INFO L226 Difference]: Without dead ends: 1369 [2025-01-09 08:20:28,501 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-01-09 08:20:28,502 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 6 mSDsluCounter, 4872 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6499 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:28,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6499 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2025-01-09 08:20:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1367. [2025-01-09 08:20:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1366 states have (on average 1.4780380673499267) internal successors, (2019), 1366 states have internal predecessors, (2019), 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-01-09 08:20:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2019 transitions. [2025-01-09 08:20:28,528 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2019 transitions. Word has length 176 [2025-01-09 08:20:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:28,531 INFO L471 AbstractCegarLoop]: Abstraction has 1367 states and 2019 transitions. [2025-01-09 08:20:28,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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-01-09 08:20:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2019 transitions. [2025-01-09 08:20:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 08:20:28,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:28,533 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] [2025-01-09 08:20:28,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:20:28,533 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:28,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash 479731145, now seen corresponding path program 1 times [2025-01-09 08:20:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:28,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953310456] [2025-01-09 08:20:28,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:28,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:28,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 08:20:28,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 08:20:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:28,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:28,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953310456] [2025-01-09 08:20:28,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953310456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:28,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865648210] [2025-01-09 08:20:28,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:28,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:28,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:28,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:28,829 INFO L87 Difference]: Start difference. First operand 1367 states and 2019 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-01-09 08:20:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:28,867 INFO L93 Difference]: Finished difference Result 2446 states and 3614 transitions. [2025-01-09 08:20:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:28,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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 177 [2025-01-09 08:20:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:28,871 INFO L225 Difference]: With dead ends: 2446 [2025-01-09 08:20:28,871 INFO L226 Difference]: Without dead ends: 1371 [2025-01-09 08:20:28,872 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-01-09 08:20:28,872 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:28,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-01-09 08:20:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2025-01-09 08:20:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1370 states have (on average 1.4766423357664233) internal successors, (2023), 1370 states have internal predecessors, (2023), 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-01-09 08:20:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2023 transitions. [2025-01-09 08:20:28,894 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2023 transitions. Word has length 177 [2025-01-09 08:20:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:28,894 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2023 transitions. [2025-01-09 08:20:28,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-01-09 08:20:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2023 transitions. [2025-01-09 08:20:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 08:20:28,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:28,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] [2025-01-09 08:20:28,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 08:20:28,897 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:28,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1938191255, now seen corresponding path program 1 times [2025-01-09 08:20:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106662906] [2025-01-09 08:20:28,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:28,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 08:20:29,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 08:20:29,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106662906] [2025-01-09 08:20:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106662906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505089466] [2025-01-09 08:20:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:29,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:29,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:29,392 INFO L87 Difference]: Start difference. First operand 1371 states and 2023 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 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-01-09 08:20:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:29,533 INFO L93 Difference]: Finished difference Result 2457 states and 3627 transitions. [2025-01-09 08:20:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 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 177 [2025-01-09 08:20:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:29,538 INFO L225 Difference]: With dead ends: 2457 [2025-01-09 08:20:29,538 INFO L226 Difference]: Without dead ends: 1378 [2025-01-09 08:20:29,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 08:20:29,540 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1475 mSDsluCounter, 6392 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 7994 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:29,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 7994 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2025-01-09 08:20:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1377. [2025-01-09 08:20:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 1.4752906976744187) internal successors, (2030), 1376 states have internal predecessors, (2030), 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-01-09 08:20:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2030 transitions. [2025-01-09 08:20:29,560 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2030 transitions. Word has length 177 [2025-01-09 08:20:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:29,561 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2030 transitions. [2025-01-09 08:20:29,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 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-01-09 08:20:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2030 transitions. [2025-01-09 08:20:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:20:29,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:29,563 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] [2025-01-09 08:20:29,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 08:20:29,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:29,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1008444747, now seen corresponding path program 1 times [2025-01-09 08:20:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:29,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233092277] [2025-01-09 08:20:29,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:29,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:20:29,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:20:29,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:29,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:29,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-01-09 08:20:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233092277] [2025-01-09 08:20:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233092277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:29,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232009670] [2025-01-09 08:20:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:29,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:29,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:29,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:29,784 INFO L87 Difference]: Start difference. First operand 1377 states and 2030 transitions. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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-01-09 08:20:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:29,817 INFO L93 Difference]: Finished difference Result 2480 states and 3657 transitions. [2025-01-09 08:20:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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 178 [2025-01-09 08:20:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:29,821 INFO L225 Difference]: With dead ends: 2480 [2025-01-09 08:20:29,821 INFO L226 Difference]: Without dead ends: 1395 [2025-01-09 08:20:29,826 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-01-09 08:20:29,826 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 16 mSDsluCounter, 4878 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6508 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:29,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6508 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-01-09 08:20:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2025-01-09 08:20:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1394 states have (on average 1.4748923959827833) internal successors, (2056), 1394 states have internal predecessors, (2056), 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-01-09 08:20:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2056 transitions. [2025-01-09 08:20:29,847 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2056 transitions. Word has length 178 [2025-01-09 08:20:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:29,848 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 2056 transitions. [2025-01-09 08:20:29,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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-01-09 08:20:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2056 transitions. [2025-01-09 08:20:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:20:29,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:29,849 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] [2025-01-09 08:20:29,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:20:29,850 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:29,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:29,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1518932928, now seen corresponding path program 1 times [2025-01-09 08:20:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214984908] [2025-01-09 08:20:29,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:29,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:20:30,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:20:30,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:30,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214984908] [2025-01-09 08:20:30,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214984908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:30,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:30,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360579310] [2025-01-09 08:20:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:30,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:30,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:30,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:30,495 INFO L87 Difference]: Start difference. First operand 1395 states and 2056 transitions. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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-01-09 08:20:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:30,583 INFO L93 Difference]: Finished difference Result 2508 states and 3696 transitions. [2025-01-09 08:20:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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 178 [2025-01-09 08:20:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:30,590 INFO L225 Difference]: With dead ends: 2508 [2025-01-09 08:20:30,590 INFO L226 Difference]: Without dead ends: 1405 [2025-01-09 08:20:30,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 08:20:30,594 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1530 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 4811 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:30,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 4811 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-01-09 08:20:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2025-01-09 08:20:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.4729344729344729) internal successors, (2068), 1404 states have internal predecessors, (2068), 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-01-09 08:20:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2068 transitions. [2025-01-09 08:20:30,613 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2068 transitions. Word has length 178 [2025-01-09 08:20:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:30,614 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2068 transitions. [2025-01-09 08:20:30,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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-01-09 08:20:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2068 transitions. [2025-01-09 08:20:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:20:30,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:30,615 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] [2025-01-09 08:20:30,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 08:20:30,616 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:30,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash 323718332, now seen corresponding path program 1 times [2025-01-09 08:20:30,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796796725] [2025-01-09 08:20:30,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:30,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:20:30,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:20:30,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:30,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796796725] [2025-01-09 08:20:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796796725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:30,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:30,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:30,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420589593] [2025-01-09 08:20:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:30,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:30,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:30,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:30,840 INFO L87 Difference]: Start difference. First operand 1405 states and 2068 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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-01-09 08:20:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:30,866 INFO L93 Difference]: Finished difference Result 2522 states and 3712 transitions. [2025-01-09 08:20:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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 178 [2025-01-09 08:20:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:30,872 INFO L225 Difference]: With dead ends: 2522 [2025-01-09 08:20:30,872 INFO L226 Difference]: Without dead ends: 1409 [2025-01-09 08:20:30,874 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-01-09 08:20:30,875 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:30,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-01-09 08:20:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1409. [2025-01-09 08:20:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4715909090909092) internal successors, (2072), 1408 states have internal predecessors, (2072), 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-01-09 08:20:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2072 transitions. [2025-01-09 08:20:30,891 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2072 transitions. Word has length 178 [2025-01-09 08:20:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:30,891 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 2072 transitions. [2025-01-09 08:20:30,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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-01-09 08:20:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2072 transitions. [2025-01-09 08:20:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:20:30,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:30,893 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] [2025-01-09 08:20:30,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 08:20:30,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:30,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash -984397021, now seen corresponding path program 1 times [2025-01-09 08:20:30,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:30,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072592322] [2025-01-09 08:20:30,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:30,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:20:31,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:20:31,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:31,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:32,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072592322] [2025-01-09 08:20:32,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072592322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:32,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:32,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:32,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268396833] [2025-01-09 08:20:32,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:32,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:32,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:32,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:32,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:32,396 INFO L87 Difference]: Start difference. First operand 1409 states and 2072 transitions. Second operand has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 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-01-09 08:20:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:32,538 INFO L93 Difference]: Finished difference Result 3151 states and 4616 transitions. [2025-01-09 08:20:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 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 178 [2025-01-09 08:20:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:32,542 INFO L225 Difference]: With dead ends: 3151 [2025-01-09 08:20:32,542 INFO L226 Difference]: Without dead ends: 2034 [2025-01-09 08:20:32,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-01-09 08:20:32,544 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 2338 mSDsluCounter, 6660 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 8266 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:32,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 8266 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2025-01-09 08:20:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2030. [2025-01-09 08:20:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.4627895515032034) internal successors, (2968), 2029 states have internal predecessors, (2968), 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-01-09 08:20:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2968 transitions. [2025-01-09 08:20:32,562 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2968 transitions. Word has length 178 [2025-01-09 08:20:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:32,563 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2968 transitions. [2025-01-09 08:20:32,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 8 states have internal predecessors, (178), 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-01-09 08:20:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2968 transitions. [2025-01-09 08:20:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:20:32,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:32,565 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] [2025-01-09 08:20:32,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 08:20:32,565 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:32,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1640055321, now seen corresponding path program 1 times [2025-01-09 08:20:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:32,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536774151] [2025-01-09 08:20:32,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:32,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:32,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:20:32,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:20:32,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:32,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536774151] [2025-01-09 08:20:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536774151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:33,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433715589] [2025-01-09 08:20:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:33,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:33,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:33,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:33,147 INFO L87 Difference]: Start difference. First operand 2030 states and 2968 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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-01-09 08:20:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:33,285 INFO L93 Difference]: Finished difference Result 3151 states and 4616 transitions. [2025-01-09 08:20:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:33,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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 178 [2025-01-09 08:20:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:33,288 INFO L225 Difference]: With dead ends: 3151 [2025-01-09 08:20:33,289 INFO L226 Difference]: Without dead ends: 2034 [2025-01-09 08:20:33,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-01-09 08:20:33,290 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1469 mSDsluCounter, 6141 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 7742 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:33,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 7742 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2025-01-09 08:20:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2030. [2025-01-09 08:20:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.4627895515032034) internal successors, (2968), 2029 states have internal predecessors, (2968), 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-01-09 08:20:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2968 transitions. [2025-01-09 08:20:33,311 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2968 transitions. Word has length 178 [2025-01-09 08:20:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:33,311 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2968 transitions. [2025-01-09 08:20:33,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 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-01-09 08:20:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2968 transitions. [2025-01-09 08:20:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 08:20:33,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:33,314 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] [2025-01-09 08:20:33,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 08:20:33,314 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:33,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2065186769, now seen corresponding path program 1 times [2025-01-09 08:20:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542419168] [2025-01-09 08:20:33,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:33,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 08:20:33,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 08:20:33,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:33,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542419168] [2025-01-09 08:20:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542419168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305723824] [2025-01-09 08:20:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:33,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:33,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:33,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:33,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:33,532 INFO L87 Difference]: Start difference. First operand 2030 states and 2968 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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-01-09 08:20:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:33,568 INFO L93 Difference]: Finished difference Result 3205 states and 4696 transitions. [2025-01-09 08:20:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:33,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 179 [2025-01-09 08:20:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:33,572 INFO L225 Difference]: With dead ends: 3205 [2025-01-09 08:20:33,572 INFO L226 Difference]: Without dead ends: 2066 [2025-01-09 08:20:33,574 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-01-09 08:20:33,574 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 16 mSDsluCounter, 4878 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6508 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:33,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6508 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2025-01-09 08:20:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2025-01-09 08:20:33,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 2065 states have (on average 1.4624697336561743) internal successors, (3020), 2065 states have internal predecessors, (3020), 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-01-09 08:20:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 3020 transitions. [2025-01-09 08:20:33,597 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 3020 transitions. Word has length 179 [2025-01-09 08:20:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:33,597 INFO L471 AbstractCegarLoop]: Abstraction has 2066 states and 3020 transitions. [2025-01-09 08:20:33,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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-01-09 08:20:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3020 transitions. [2025-01-09 08:20:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 08:20:33,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:33,599 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] [2025-01-09 08:20:33,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 08:20:33,600 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:33,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2032528528, now seen corresponding path program 1 times [2025-01-09 08:20:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:33,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961390191] [2025-01-09 08:20:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:33,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 08:20:33,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 08:20:33,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:34,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-01-09 08:20:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:34,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961390191] [2025-01-09 08:20:34,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961390191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:34,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:34,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 08:20:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326335645] [2025-01-09 08:20:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:34,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 08:20:34,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:34,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 08:20:34,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:34,320 INFO L87 Difference]: Start difference. First operand 2066 states and 3020 transitions. Second operand has 12 states, 12 states have (on average 14.916666666666666) internal successors, (179), 12 states have internal predecessors, (179), 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-01-09 08:20:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:34,435 INFO L93 Difference]: Finished difference Result 3502 states and 5115 transitions. [2025-01-09 08:20:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 08:20:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.916666666666666) internal successors, (179), 12 states have internal predecessors, (179), 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 179 [2025-01-09 08:20:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:34,439 INFO L225 Difference]: With dead ends: 3502 [2025-01-09 08:20:34,439 INFO L226 Difference]: Without dead ends: 2158 [2025-01-09 08:20:34,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:20:34,441 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 41 mSDsluCounter, 9785 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 11403 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:34,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 11403 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-01-09 08:20:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2128. [2025-01-09 08:20:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2127 states have (on average 1.459332393041843) internal successors, (3104), 2127 states have internal predecessors, (3104), 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-01-09 08:20:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3104 transitions. [2025-01-09 08:20:34,466 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3104 transitions. Word has length 179 [2025-01-09 08:20:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:34,466 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 3104 transitions. [2025-01-09 08:20:34,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.916666666666666) internal successors, (179), 12 states have internal predecessors, (179), 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-01-09 08:20:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3104 transitions. [2025-01-09 08:20:34,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 08:20:34,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:34,468 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] [2025-01-09 08:20:34,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 08:20:34,469 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:34,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1501582569, now seen corresponding path program 1 times [2025-01-09 08:20:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138552025] [2025-01-09 08:20:34,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:34,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 08:20:34,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 08:20:34,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:34,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138552025] [2025-01-09 08:20:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138552025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:34,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:34,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:34,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054686736] [2025-01-09 08:20:34,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:34,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:34,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:34,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:34,884 INFO L87 Difference]: Start difference. First operand 2128 states and 3104 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-01-09 08:20:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:35,567 INFO L93 Difference]: Finished difference Result 4576 states and 6645 transitions. [2025-01-09 08:20:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:35,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 179 [2025-01-09 08:20:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:35,573 INFO L225 Difference]: With dead ends: 4576 [2025-01-09 08:20:35,573 INFO L226 Difference]: Without dead ends: 3148 [2025-01-09 08:20:35,576 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-01-09 08:20:35,576 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 1844 mSDsluCounter, 3943 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 5261 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:35,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 5261 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:20:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-01-09 08:20:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2872. [2025-01-09 08:20:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2871 states have (on average 1.4559386973180077) internal successors, (4180), 2871 states have internal predecessors, (4180), 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-01-09 08:20:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 4180 transitions. [2025-01-09 08:20:35,610 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 4180 transitions. Word has length 179 [2025-01-09 08:20:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:35,610 INFO L471 AbstractCegarLoop]: Abstraction has 2872 states and 4180 transitions. [2025-01-09 08:20:35,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-01-09 08:20:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 4180 transitions. [2025-01-09 08:20:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 08:20:35,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:35,614 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] [2025-01-09 08:20:35,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 08:20:35,614 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:35,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1085672593, now seen corresponding path program 1 times [2025-01-09 08:20:35,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:35,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017037852] [2025-01-09 08:20:35,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:35,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:35,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 08:20:35,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 08:20:35,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017037852] [2025-01-09 08:20:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017037852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:36,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:36,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168669009] [2025-01-09 08:20:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:36,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:36,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:36,011 INFO L87 Difference]: Start difference. First operand 2872 states and 4180 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-01-09 08:20:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:36,707 INFO L93 Difference]: Finished difference Result 4749 states and 6866 transitions. [2025-01-09 08:20:36,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:36,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 179 [2025-01-09 08:20:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:36,712 INFO L225 Difference]: With dead ends: 4749 [2025-01-09 08:20:36,712 INFO L226 Difference]: Without dead ends: 3148 [2025-01-09 08:20:36,714 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-01-09 08:20:36,714 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 2084 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 5259 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:36,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 5259 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-01-09 08:20:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2872. [2025-01-09 08:20:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2871 states have (on average 1.4531522117729014) internal successors, (4172), 2871 states have internal predecessors, (4172), 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-01-09 08:20:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 4172 transitions. [2025-01-09 08:20:36,738 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 4172 transitions. Word has length 179 [2025-01-09 08:20:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:36,738 INFO L471 AbstractCegarLoop]: Abstraction has 2872 states and 4172 transitions. [2025-01-09 08:20:36,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-01-09 08:20:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 4172 transitions. [2025-01-09 08:20:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 08:20:36,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:36,741 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] [2025-01-09 08:20:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 08:20:36,742 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:36,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:36,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1266498754, now seen corresponding path program 1 times [2025-01-09 08:20:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:36,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368841715] [2025-01-09 08:20:36,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:36,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:36,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 08:20:36,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 08:20:36,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:36,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:37,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:37,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368841715] [2025-01-09 08:20:37,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368841715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:37,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159410539] [2025-01-09 08:20:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:37,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:37,155 INFO L87 Difference]: Start difference. First operand 2872 states and 4172 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-01-09 08:20:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:37,281 INFO L93 Difference]: Finished difference Result 6349 states and 9154 transitions. [2025-01-09 08:20:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 179 [2025-01-09 08:20:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:37,289 INFO L225 Difference]: With dead ends: 6349 [2025-01-09 08:20:37,289 INFO L226 Difference]: Without dead ends: 4494 [2025-01-09 08:20:37,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 08:20:37,294 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 1890 mSDsluCounter, 4811 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 6418 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:37,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 6418 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4494 states. [2025-01-09 08:20:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4494 to 3872. [2025-01-09 08:20:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3872 states, 3871 states have (on average 1.4621544820459829) internal successors, (5660), 3871 states have internal predecessors, (5660), 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-01-09 08:20:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 5660 transitions. [2025-01-09 08:20:37,336 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 5660 transitions. Word has length 179 [2025-01-09 08:20:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:37,337 INFO L471 AbstractCegarLoop]: Abstraction has 3872 states and 5660 transitions. [2025-01-09 08:20:37,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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-01-09 08:20:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 5660 transitions. [2025-01-09 08:20:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:37,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:37,342 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] [2025-01-09 08:20:37,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 08:20:37,343 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:37,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -581327281, now seen corresponding path program 1 times [2025-01-09 08:20:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011130653] [2025-01-09 08:20:37,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:37,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:37,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:37,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:37,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:37,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:38,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011130653] [2025-01-09 08:20:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011130653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:38,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:20:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693236965] [2025-01-09 08:20:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:38,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:20:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:38,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:20:38,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:20:38,227 INFO L87 Difference]: Start difference. First operand 3872 states and 5660 transitions. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 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-01-09 08:20:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:38,451 INFO L93 Difference]: Finished difference Result 6088 states and 8850 transitions. [2025-01-09 08:20:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:20:38,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:38,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:38,459 INFO L225 Difference]: With dead ends: 6088 [2025-01-09 08:20:38,459 INFO L226 Difference]: Without dead ends: 4825 [2025-01-09 08:20:38,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-01-09 08:20:38,463 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1855 mSDsluCounter, 8829 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 10427 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:38,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1855 Valid, 10427 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2025-01-09 08:20:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 4524. [2025-01-09 08:20:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4523 states have (on average 1.449480433340703) internal successors, (6556), 4523 states have internal predecessors, (6556), 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-01-09 08:20:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 6556 transitions. [2025-01-09 08:20:38,552 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 6556 transitions. Word has length 180 [2025-01-09 08:20:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:38,552 INFO L471 AbstractCegarLoop]: Abstraction has 4524 states and 6556 transitions. [2025-01-09 08:20:38,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 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-01-09 08:20:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 6556 transitions. [2025-01-09 08:20:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:38,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:38,558 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] [2025-01-09 08:20:38,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 08:20:38,558 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:38,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash -723128525, now seen corresponding path program 1 times [2025-01-09 08:20:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:38,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811005156] [2025-01-09 08:20:38,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:38,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:38,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:38,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:38,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811005156] [2025-01-09 08:20:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811005156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:39,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:39,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:39,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561755496] [2025-01-09 08:20:39,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:39,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:39,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:39,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:39,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:39,300 INFO L87 Difference]: Start difference. First operand 4524 states and 6556 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-01-09 08:20:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:39,394 INFO L93 Difference]: Finished difference Result 6103 states and 8850 transitions. [2025-01-09 08:20:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:39,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:39,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:39,401 INFO L225 Difference]: With dead ends: 6103 [2025-01-09 08:20:39,401 INFO L226 Difference]: Without dead ends: 4556 [2025-01-09 08:20:39,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:39,404 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 1516 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 4811 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:39,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 4811 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2025-01-09 08:20:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 4556. [2025-01-09 08:20:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4556 states, 4555 states have (on average 1.4472008781558727) internal successors, (6592), 4555 states have internal predecessors, (6592), 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-01-09 08:20:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 4556 states and 6592 transitions. [2025-01-09 08:20:39,449 INFO L78 Accepts]: Start accepts. Automaton has 4556 states and 6592 transitions. Word has length 180 [2025-01-09 08:20:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:39,450 INFO L471 AbstractCegarLoop]: Abstraction has 4556 states and 6592 transitions. [2025-01-09 08:20:39,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-01-09 08:20:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4556 states and 6592 transitions. [2025-01-09 08:20:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:39,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:39,455 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] [2025-01-09 08:20:39,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 08:20:39,455 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:39,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:39,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1296498129, now seen corresponding path program 1 times [2025-01-09 08:20:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:39,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350059387] [2025-01-09 08:20:39,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:39,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:39,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:39,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:39,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:39,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350059387] [2025-01-09 08:20:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350059387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:39,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:20:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210570331] [2025-01-09 08:20:39,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:39,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:20:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:39,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:20:39,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:20:39,667 INFO L87 Difference]: Start difference. First operand 4556 states and 6592 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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-01-09 08:20:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:39,698 INFO L93 Difference]: Finished difference Result 6215 states and 8994 transitions. [2025-01-09 08:20:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:20:39,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:39,704 INFO L225 Difference]: With dead ends: 6215 [2025-01-09 08:20:39,704 INFO L226 Difference]: Without dead ends: 4572 [2025-01-09 08:20:39,707 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-01-09 08:20:39,707 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 0 mSDsluCounter, 3252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:39,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4883 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2025-01-09 08:20:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4572. [2025-01-09 08:20:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4572 states, 4571 states have (on average 1.445635528330781) internal successors, (6608), 4571 states have internal predecessors, (6608), 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-01-09 08:20:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4572 states to 4572 states and 6608 transitions. [2025-01-09 08:20:39,751 INFO L78 Accepts]: Start accepts. Automaton has 4572 states and 6608 transitions. Word has length 180 [2025-01-09 08:20:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:39,751 INFO L471 AbstractCegarLoop]: Abstraction has 4572 states and 6608 transitions. [2025-01-09 08:20:39,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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-01-09 08:20:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4572 states and 6608 transitions. [2025-01-09 08:20:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:39,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:39,756 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] [2025-01-09 08:20:39,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 08:20:39,757 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:39,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -791289066, now seen corresponding path program 1 times [2025-01-09 08:20:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:39,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203630978] [2025-01-09 08:20:39,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:39,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:39,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:39,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:39,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:39,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203630978] [2025-01-09 08:20:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203630978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 08:20:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513572680] [2025-01-09 08:20:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:40,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 08:20:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:40,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 08:20:40,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:20:40,616 INFO L87 Difference]: Start difference. First operand 4572 states and 6608 transitions. Second operand has 15 states, 15 states have (on average 12.0) internal successors, (180), 15 states have internal predecessors, (180), 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-01-09 08:20:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:40,791 INFO L93 Difference]: Finished difference Result 6477 states and 9340 transitions. [2025-01-09 08:20:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 08:20:40,792 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.0) internal successors, (180), 15 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:40,800 INFO L225 Difference]: With dead ends: 6477 [2025-01-09 08:20:40,800 INFO L226 Difference]: Without dead ends: 4836 [2025-01-09 08:20:40,803 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-01-09 08:20:40,804 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 60 mSDsluCounter, 14581 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 16193 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:40,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 16193 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4836 states. [2025-01-09 08:20:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4760. [2025-01-09 08:20:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4759 states have (on average 1.4423198150872032) internal successors, (6864), 4759 states have internal predecessors, (6864), 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-01-09 08:20:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6864 transitions. [2025-01-09 08:20:40,858 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6864 transitions. Word has length 180 [2025-01-09 08:20:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:40,858 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6864 transitions. [2025-01-09 08:20:40,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.0) internal successors, (180), 15 states have internal predecessors, (180), 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-01-09 08:20:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6864 transitions. [2025-01-09 08:20:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:40,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:40,863 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] [2025-01-09 08:20:40,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 08:20:40,864 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:40,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:40,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1353717745, now seen corresponding path program 1 times [2025-01-09 08:20:40,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:40,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217742388] [2025-01-09 08:20:40,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:40,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:40,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:41,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:41,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:41,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:41,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:41,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217742388] [2025-01-09 08:20:41,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217742388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:41,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515778143] [2025-01-09 08:20:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:41,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:41,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:41,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:41,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:41,545 INFO L87 Difference]: Start difference. First operand 4760 states and 6864 transitions. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-01-09 08:20:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:42,216 INFO L93 Difference]: Finished difference Result 7297 states and 10432 transitions. [2025-01-09 08:20:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:42,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:42,222 INFO L225 Difference]: With dead ends: 7297 [2025-01-09 08:20:42,223 INFO L226 Difference]: Without dead ends: 5476 [2025-01-09 08:20:42,224 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-01-09 08:20:42,225 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 2032 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 5259 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:42,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 5259 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:20:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2025-01-09 08:20:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 5180. [2025-01-09 08:20:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 5179 states have (on average 1.4334813670592779) internal successors, (7424), 5179 states have internal predecessors, (7424), 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-01-09 08:20:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 7424 transitions. [2025-01-09 08:20:42,266 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 7424 transitions. Word has length 180 [2025-01-09 08:20:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:42,267 INFO L471 AbstractCegarLoop]: Abstraction has 5180 states and 7424 transitions. [2025-01-09 08:20:42,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-01-09 08:20:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 7424 transitions. [2025-01-09 08:20:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:42,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:42,272 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] [2025-01-09 08:20:42,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 08:20:42,272 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:42,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 559838430, now seen corresponding path program 1 times [2025-01-09 08:20:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792336968] [2025-01-09 08:20:42,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:42,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:42,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:42,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:42,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792336968] [2025-01-09 08:20:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792336968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073418004] [2025-01-09 08:20:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:42,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:42,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:42,774 INFO L87 Difference]: Start difference. First operand 5180 states and 7424 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-01-09 08:20:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:42,910 INFO L93 Difference]: Finished difference Result 10903 states and 15520 transitions. [2025-01-09 08:20:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:42,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:42,919 INFO L225 Difference]: With dead ends: 10903 [2025-01-09 08:20:42,919 INFO L226 Difference]: Without dead ends: 8752 [2025-01-09 08:20:42,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 08:20:42,924 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 2131 mSDsluCounter, 6411 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2131 SdHoareTripleChecker+Valid, 8018 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:42,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2131 Valid, 8018 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2025-01-09 08:20:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 8084. [2025-01-09 08:20:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8084 states, 8083 states have (on average 1.4296672027712483) internal successors, (11556), 8083 states have internal predecessors, (11556), 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-01-09 08:20:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8084 states to 8084 states and 11556 transitions. [2025-01-09 08:20:43,002 INFO L78 Accepts]: Start accepts. Automaton has 8084 states and 11556 transitions. Word has length 180 [2025-01-09 08:20:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:43,003 INFO L471 AbstractCegarLoop]: Abstraction has 8084 states and 11556 transitions. [2025-01-09 08:20:43,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-01-09 08:20:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8084 states and 11556 transitions. [2025-01-09 08:20:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:43,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:43,012 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] [2025-01-09 08:20:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 08:20:43,012 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:43,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1550403820, now seen corresponding path program 1 times [2025-01-09 08:20:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424943449] [2025-01-09 08:20:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:43,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:43,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:43,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:43,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:43,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424943449] [2025-01-09 08:20:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424943449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097128164] [2025-01-09 08:20:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:43,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:43,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:43,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:43,469 INFO L87 Difference]: Start difference. First operand 8084 states and 11556 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-01-09 08:20:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:43,530 INFO L93 Difference]: Finished difference Result 10705 states and 15220 transitions. [2025-01-09 08:20:43,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:43,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:43,538 INFO L225 Difference]: With dead ends: 10705 [2025-01-09 08:20:43,538 INFO L226 Difference]: Without dead ends: 8260 [2025-01-09 08:20:43,542 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-01-09 08:20:43,543 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 217 mSDsluCounter, 4873 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 6503 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:43,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 6503 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8260 states. [2025-01-09 08:20:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8260 to 7964. [2025-01-09 08:20:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7964 states, 7963 states have (on average 1.4271003390681904) internal successors, (11364), 7963 states have internal predecessors, (11364), 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-01-09 08:20:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7964 states to 7964 states and 11364 transitions. [2025-01-09 08:20:43,615 INFO L78 Accepts]: Start accepts. Automaton has 7964 states and 11364 transitions. Word has length 180 [2025-01-09 08:20:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:43,615 INFO L471 AbstractCegarLoop]: Abstraction has 7964 states and 11364 transitions. [2025-01-09 08:20:43,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-01-09 08:20:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7964 states and 11364 transitions. [2025-01-09 08:20:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:43,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:43,624 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] [2025-01-09 08:20:43,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 08:20:43,624 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:43,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2129141763, now seen corresponding path program 1 times [2025-01-09 08:20:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508950331] [2025-01-09 08:20:43,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:43,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:43,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:43,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:43,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:44,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:44,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508950331] [2025-01-09 08:20:44,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508950331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:44,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564431513] [2025-01-09 08:20:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:44,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:44,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:44,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:44,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:44,009 INFO L87 Difference]: Start difference. First operand 7964 states and 11364 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-01-09 08:20:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:44,076 INFO L93 Difference]: Finished difference Result 9847 states and 14043 transitions. [2025-01-09 08:20:44,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:44,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:44,084 INFO L225 Difference]: With dead ends: 9847 [2025-01-09 08:20:44,084 INFO L226 Difference]: Without dead ends: 7490 [2025-01-09 08:20:44,088 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-01-09 08:20:44,088 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 225 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 6509 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:44,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 6509 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7490 states. [2025-01-09 08:20:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7490 to 7342. [2025-01-09 08:20:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7342 states, 7341 states have (on average 1.4365890205694047) internal successors, (10546), 7341 states have internal predecessors, (10546), 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-01-09 08:20:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 10546 transitions. [2025-01-09 08:20:44,155 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 10546 transitions. Word has length 180 [2025-01-09 08:20:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:44,155 INFO L471 AbstractCegarLoop]: Abstraction has 7342 states and 10546 transitions. [2025-01-09 08:20:44,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-01-09 08:20:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 10546 transitions. [2025-01-09 08:20:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:44,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:44,165 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] [2025-01-09 08:20:44,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 08:20:44,165 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:44,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1064092010, now seen corresponding path program 1 times [2025-01-09 08:20:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249080720] [2025-01-09 08:20:44,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:44,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:44,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:44,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:44,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:44,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249080720] [2025-01-09 08:20:44,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249080720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:44,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:44,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:20:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530590788] [2025-01-09 08:20:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:44,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:20:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:44,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:20:44,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:20:44,834 INFO L87 Difference]: Start difference. First operand 7342 states and 10546 transitions. Second operand has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 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-01-09 08:20:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:45,027 INFO L93 Difference]: Finished difference Result 16001 states and 22798 transitions. [2025-01-09 08:20:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:20:45,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:45,040 INFO L225 Difference]: With dead ends: 16001 [2025-01-09 08:20:45,040 INFO L226 Difference]: Without dead ends: 12954 [2025-01-09 08:20:45,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:20:45,047 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 2132 mSDsluCounter, 8009 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 9615 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:45,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 9615 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12954 states. [2025-01-09 08:20:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12954 to 7342. [2025-01-09 08:20:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7342 states, 7341 states have (on average 1.4365890205694047) internal successors, (10546), 7341 states have internal predecessors, (10546), 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-01-09 08:20:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 10546 transitions. [2025-01-09 08:20:45,156 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 10546 transitions. Word has length 180 [2025-01-09 08:20:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:45,156 INFO L471 AbstractCegarLoop]: Abstraction has 7342 states and 10546 transitions. [2025-01-09 08:20:45,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 8 states have internal predecessors, (180), 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-01-09 08:20:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 10546 transitions. [2025-01-09 08:20:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:45,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:45,165 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] [2025-01-09 08:20:45,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 08:20:45,165 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:45,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2058653662, now seen corresponding path program 1 times [2025-01-09 08:20:45,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:45,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68659562] [2025-01-09 08:20:45,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:45,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:45,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:45,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:45,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:45,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:45,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68659562] [2025-01-09 08:20:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68659562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:45,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:45,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:45,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186514899] [2025-01-09 08:20:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:45,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:45,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:45,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:45,662 INFO L87 Difference]: Start difference. First operand 7342 states and 10546 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-01-09 08:20:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:46,189 INFO L93 Difference]: Finished difference Result 13948 states and 20010 transitions. [2025-01-09 08:20:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:20:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:46,197 INFO L225 Difference]: With dead ends: 13948 [2025-01-09 08:20:46,197 INFO L226 Difference]: Without dead ends: 10108 [2025-01-09 08:20:46,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:20:46,202 INFO L435 NwaCegarLoop]: 2940 mSDtfsCounter, 1576 mSDsluCounter, 13085 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 16025 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:46,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 16025 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:20:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10108 states. [2025-01-09 08:20:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10108 to 9278. [2025-01-09 08:20:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9278 states, 9277 states have (on average 1.4446480543279077) internal successors, (13402), 9277 states have internal predecessors, (13402), 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-01-09 08:20:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 13402 transitions. [2025-01-09 08:20:46,267 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 13402 transitions. Word has length 180 [2025-01-09 08:20:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:46,267 INFO L471 AbstractCegarLoop]: Abstraction has 9278 states and 13402 transitions. [2025-01-09 08:20:46,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-01-09 08:20:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 13402 transitions. [2025-01-09 08:20:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:46,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:46,274 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] [2025-01-09 08:20:46,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 08:20:46,274 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1820403658, now seen corresponding path program 1 times [2025-01-09 08:20:46,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296659878] [2025-01-09 08:20:46,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:46,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:46,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:46,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:46,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:46,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296659878] [2025-01-09 08:20:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296659878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928029890] [2025-01-09 08:20:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:46,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:46,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:46,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:46,601 INFO L87 Difference]: Start difference. First operand 9278 states and 13402 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-01-09 08:20:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:47,078 INFO L93 Difference]: Finished difference Result 11977 states and 17206 transitions. [2025-01-09 08:20:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:20:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:47,088 INFO L225 Difference]: With dead ends: 11977 [2025-01-09 08:20:47,088 INFO L226 Difference]: Without dead ends: 10334 [2025-01-09 08:20:47,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:47,092 INFO L435 NwaCegarLoop]: 1904 mSDtfsCounter, 236 mSDsluCounter, 8487 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 10391 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:47,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 10391 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:20:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10334 states. [2025-01-09 08:20:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10334 to 10114. [2025-01-09 08:20:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10114 states, 10113 states have (on average 1.4377533867299515) internal successors, (14540), 10113 states have internal predecessors, (14540), 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-01-09 08:20:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10114 states to 10114 states and 14540 transitions. [2025-01-09 08:20:47,174 INFO L78 Accepts]: Start accepts. Automaton has 10114 states and 14540 transitions. Word has length 180 [2025-01-09 08:20:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:47,174 INFO L471 AbstractCegarLoop]: Abstraction has 10114 states and 14540 transitions. [2025-01-09 08:20:47,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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-01-09 08:20:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 10114 states and 14540 transitions. [2025-01-09 08:20:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:20:47,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:47,183 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] [2025-01-09 08:20:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 08:20:47,183 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:47,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1272298263, now seen corresponding path program 1 times [2025-01-09 08:20:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:47,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173416858] [2025-01-09 08:20:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:47,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:20:47,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:20:47,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:47,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:47,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173416858] [2025-01-09 08:20:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173416858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:47,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:47,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353353829] [2025-01-09 08:20:47,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:47,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:47,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:47,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:47,626 INFO L87 Difference]: Start difference. First operand 10114 states and 14540 transitions. Second operand has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-01-09 08:20:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:47,837 INFO L93 Difference]: Finished difference Result 22403 states and 31972 transitions. [2025-01-09 08:20:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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 180 [2025-01-09 08:20:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:47,864 INFO L225 Difference]: With dead ends: 22403 [2025-01-09 08:20:47,864 INFO L226 Difference]: Without dead ends: 17916 [2025-01-09 08:20:47,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 08:20:47,877 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 1884 mSDsluCounter, 4811 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 6418 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:47,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 6418 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17916 states. [2025-01-09 08:20:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17916 to 12866. [2025-01-09 08:20:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12866 states, 12865 states have (on average 1.4501360279828994) internal successors, (18656), 12865 states have internal predecessors, (18656), 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-01-09 08:20:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12866 states to 12866 states and 18656 transitions. [2025-01-09 08:20:48,017 INFO L78 Accepts]: Start accepts. Automaton has 12866 states and 18656 transitions. Word has length 180 [2025-01-09 08:20:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:48,017 INFO L471 AbstractCegarLoop]: Abstraction has 12866 states and 18656 transitions. [2025-01-09 08:20:48,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-01-09 08:20:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 12866 states and 18656 transitions. [2025-01-09 08:20:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:48,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:48,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] [2025-01-09 08:20:48,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 08:20:48,028 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:48,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1483406388, now seen corresponding path program 1 times [2025-01-09 08:20:48,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:48,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490830511] [2025-01-09 08:20:48,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:48,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:48,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490830511] [2025-01-09 08:20:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490830511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:48,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 08:20:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510250013] [2025-01-09 08:20:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 08:20:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:48,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 08:20:48,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-01-09 08:20:48,940 INFO L87 Difference]: Start difference. First operand 12866 states and 18656 transitions. Second operand has 20 states, 20 states have (on average 9.05) internal successors, (181), 20 states have internal predecessors, (181), 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-01-09 08:20:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:49,337 INFO L93 Difference]: Finished difference Result 14917 states and 21583 transitions. [2025-01-09 08:20:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 08:20:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.05) internal successors, (181), 20 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:49,349 INFO L225 Difference]: With dead ends: 14917 [2025-01-09 08:20:49,349 INFO L226 Difference]: Without dead ends: 13308 [2025-01-09 08:20:49,355 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-01-09 08:20:49,355 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 88 mSDsluCounter, 27223 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 28827 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:49,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 28827 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:20:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13308 states. [2025-01-09 08:20:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13308 to 13258. [2025-01-09 08:20:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13258 states, 13257 states have (on average 1.4487440597420231) internal successors, (19206), 13257 states have internal predecessors, (19206), 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-01-09 08:20:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13258 states to 13258 states and 19206 transitions. [2025-01-09 08:20:49,477 INFO L78 Accepts]: Start accepts. Automaton has 13258 states and 19206 transitions. Word has length 181 [2025-01-09 08:20:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:49,477 INFO L471 AbstractCegarLoop]: Abstraction has 13258 states and 19206 transitions. [2025-01-09 08:20:49,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.05) internal successors, (181), 20 states have internal predecessors, (181), 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-01-09 08:20:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13258 states and 19206 transitions. [2025-01-09 08:20:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:49,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:49,490 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] [2025-01-09 08:20:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 08:20:49,491 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:49,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash 370261940, now seen corresponding path program 1 times [2025-01-09 08:20:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655865280] [2025-01-09 08:20:49,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:49,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:49,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:49,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:49,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655865280] [2025-01-09 08:20:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655865280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 08:20:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169704240] [2025-01-09 08:20:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:50,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 08:20:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:50,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 08:20:50,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:20:50,328 INFO L87 Difference]: Start difference. First operand 13258 states and 19206 transitions. Second operand has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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-01-09 08:20:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:50,605 INFO L93 Difference]: Finished difference Result 15087 states and 21826 transitions. [2025-01-09 08:20:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 08:20:50,606 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:50,619 INFO L225 Difference]: With dead ends: 15087 [2025-01-09 08:20:50,620 INFO L226 Difference]: Without dead ends: 13304 [2025-01-09 08:20:50,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:20:50,678 INFO L435 NwaCegarLoop]: 1611 mSDtfsCounter, 76 mSDsluCounter, 20980 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 22591 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:50,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 22591 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:20:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13304 states. [2025-01-09 08:20:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13304 to 13262. [2025-01-09 08:20:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13262 states, 13261 states have (on average 1.4486087022094865) internal successors, (19210), 13261 states have internal predecessors, (19210), 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-01-09 08:20:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13262 states to 13262 states and 19210 transitions. [2025-01-09 08:20:50,781 INFO L78 Accepts]: Start accepts. Automaton has 13262 states and 19210 transitions. Word has length 181 [2025-01-09 08:20:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 13262 states and 19210 transitions. [2025-01-09 08:20:50,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 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-01-09 08:20:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13262 states and 19210 transitions. [2025-01-09 08:20:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:50,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:50,805 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] [2025-01-09 08:20:50,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 08:20:50,805 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:50,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1959388645, now seen corresponding path program 1 times [2025-01-09 08:20:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302200986] [2025-01-09 08:20:50,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:50,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:50,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:51,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:51,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:51,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:51,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:51,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302200986] [2025-01-09 08:20:51,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302200986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:51,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:51,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341370740] [2025-01-09 08:20:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:51,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:51,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:51,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:51,174 INFO L87 Difference]: Start difference. First operand 13262 states and 19210 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:51,690 INFO L93 Difference]: Finished difference Result 15338 states and 22174 transitions. [2025-01-09 08:20:51,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:51,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:51,704 INFO L225 Difference]: With dead ends: 15338 [2025-01-09 08:20:51,704 INFO L226 Difference]: Without dead ends: 13482 [2025-01-09 08:20:51,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:51,710 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1807 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 5294 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:51,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 5294 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:20:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13482 states. [2025-01-09 08:20:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13482 to 13482. [2025-01-09 08:20:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13482 states, 13481 states have (on average 1.4458868036495809) internal successors, (19492), 13481 states have internal predecessors, (19492), 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-01-09 08:20:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13482 states to 13482 states and 19492 transitions. [2025-01-09 08:20:51,830 INFO L78 Accepts]: Start accepts. Automaton has 13482 states and 19492 transitions. Word has length 181 [2025-01-09 08:20:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:51,830 INFO L471 AbstractCegarLoop]: Abstraction has 13482 states and 19492 transitions. [2025-01-09 08:20:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 13482 states and 19492 transitions. [2025-01-09 08:20:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:51,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:51,842 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] [2025-01-09 08:20:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 08:20:51,843 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash -854071060, now seen corresponding path program 1 times [2025-01-09 08:20:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295469682] [2025-01-09 08:20:51,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:51,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:51,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:51,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:51,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295469682] [2025-01-09 08:20:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295469682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:52,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:52,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973103227] [2025-01-09 08:20:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:52,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:52,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:52,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:52,323 INFO L87 Difference]: Start difference. First operand 13482 states and 19492 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:20:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:52,503 INFO L93 Difference]: Finished difference Result 25817 states and 37116 transitions. [2025-01-09 08:20:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:52,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:52,527 INFO L225 Difference]: With dead ends: 25817 [2025-01-09 08:20:52,527 INFO L226 Difference]: Without dead ends: 23616 [2025-01-09 08:20:52,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 08:20:52,538 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 2113 mSDsluCounter, 6410 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2113 SdHoareTripleChecker+Valid, 8017 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:52,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2113 Valid, 8017 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23616 states. [2025-01-09 08:20:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23616 to 23062. [2025-01-09 08:20:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23062 states, 23061 states have (on average 1.4408742032002082) internal successors, (33228), 23061 states have internal predecessors, (33228), 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-01-09 08:20:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23062 states to 23062 states and 33228 transitions. [2025-01-09 08:20:52,796 INFO L78 Accepts]: Start accepts. Automaton has 23062 states and 33228 transitions. Word has length 181 [2025-01-09 08:20:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:52,796 INFO L471 AbstractCegarLoop]: Abstraction has 23062 states and 33228 transitions. [2025-01-09 08:20:52,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:20:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 23062 states and 33228 transitions. [2025-01-09 08:20:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:52,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:52,815 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] [2025-01-09 08:20:52,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 08:20:52,816 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash -875411722, now seen corresponding path program 1 times [2025-01-09 08:20:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213668787] [2025-01-09 08:20:52,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:52,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:52,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:52,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:52,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:53,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213668787] [2025-01-09 08:20:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213668787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:53,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:20:53,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637822554] [2025-01-09 08:20:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:53,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:20:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:53,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:20:53,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:20:53,171 INFO L87 Difference]: Start difference. First operand 23062 states and 33228 transitions. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 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-01-09 08:20:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:53,265 INFO L93 Difference]: Finished difference Result 25086 states and 36109 transitions. [2025-01-09 08:20:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:20:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:53,286 INFO L225 Difference]: With dead ends: 25086 [2025-01-09 08:20:53,287 INFO L226 Difference]: Without dead ends: 22942 [2025-01-09 08:20:53,296 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-01-09 08:20:53,296 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 195 mSDsluCounter, 4889 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 6527 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:53,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 6527 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:20:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22942 states. [2025-01-09 08:20:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22942 to 22942. [2025-01-09 08:20:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22942 states, 22941 states have (on average 1.440913648053703) internal successors, (33056), 22941 states have internal predecessors, (33056), 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-01-09 08:20:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22942 states to 22942 states and 33056 transitions. [2025-01-09 08:20:53,494 INFO L78 Accepts]: Start accepts. Automaton has 22942 states and 33056 transitions. Word has length 181 [2025-01-09 08:20:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:53,495 INFO L471 AbstractCegarLoop]: Abstraction has 22942 states and 33056 transitions. [2025-01-09 08:20:53,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 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-01-09 08:20:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22942 states and 33056 transitions. [2025-01-09 08:20:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:53,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:53,512 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] [2025-01-09 08:20:53,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 08:20:53,512 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:53,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1503021076, now seen corresponding path program 1 times [2025-01-09 08:20:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726575617] [2025-01-09 08:20:53,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:53,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:53,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:53,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:53,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:53,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:53,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:53,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726575617] [2025-01-09 08:20:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726575617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277081912] [2025-01-09 08:20:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:53,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:53,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:53,997 INFO L87 Difference]: Start difference. First operand 22942 states and 33056 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:54,221 INFO L93 Difference]: Finished difference Result 46749 states and 67044 transitions. [2025-01-09 08:20:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:54,270 INFO L225 Difference]: With dead ends: 46749 [2025-01-09 08:20:54,271 INFO L226 Difference]: Without dead ends: 43036 [2025-01-09 08:20:54,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 08:20:54,290 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 2120 mSDsluCounter, 4809 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 6416 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:54,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2120 Valid, 6416 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43036 states. [2025-01-09 08:20:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43036 to 22942. [2025-01-09 08:20:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22942 states, 22941 states have (on average 1.440913648053703) internal successors, (33056), 22941 states have internal predecessors, (33056), 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-01-09 08:20:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22942 states to 22942 states and 33056 transitions. [2025-01-09 08:20:54,684 INFO L78 Accepts]: Start accepts. Automaton has 22942 states and 33056 transitions. Word has length 181 [2025-01-09 08:20:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:54,684 INFO L471 AbstractCegarLoop]: Abstraction has 22942 states and 33056 transitions. [2025-01-09 08:20:54,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 22942 states and 33056 transitions. [2025-01-09 08:20:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:54,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:54,708 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] [2025-01-09 08:20:54,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 08:20:54,709 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:54,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1925057201, now seen corresponding path program 1 times [2025-01-09 08:20:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:54,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294905485] [2025-01-09 08:20:54,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:54,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:54,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:54,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:54,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:55,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294905485] [2025-01-09 08:20:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294905485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:55,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:55,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:20:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010894018] [2025-01-09 08:20:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:55,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:20:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:55,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:20:55,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:20:55,176 INFO L87 Difference]: Start difference. First operand 22942 states and 33056 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:20:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:55,400 INFO L93 Difference]: Finished difference Result 49533 states and 70892 transitions. [2025-01-09 08:20:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:55,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:55,443 INFO L225 Difference]: With dead ends: 49533 [2025-01-09 08:20:55,443 INFO L226 Difference]: Without dead ends: 43306 [2025-01-09 08:20:55,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 08:20:55,461 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 2133 mSDsluCounter, 6410 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 8017 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:55,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 8017 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:20:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43306 states. [2025-01-09 08:20:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43306 to 30934. [2025-01-09 08:20:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30934 states, 30933 states have (on average 1.4506190799469822) internal successors, (44872), 30933 states have internal predecessors, (44872), 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-01-09 08:20:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30934 states to 30934 states and 44872 transitions. [2025-01-09 08:20:55,803 INFO L78 Accepts]: Start accepts. Automaton has 30934 states and 44872 transitions. Word has length 181 [2025-01-09 08:20:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:55,803 INFO L471 AbstractCegarLoop]: Abstraction has 30934 states and 44872 transitions. [2025-01-09 08:20:55,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:20:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 30934 states and 44872 transitions. [2025-01-09 08:20:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:55,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:55,831 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] [2025-01-09 08:20:55,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 08:20:55,832 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:55,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:55,832 INFO L85 PathProgramCache]: Analyzing trace with hash 102667632, now seen corresponding path program 1 times [2025-01-09 08:20:55,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:55,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887405067] [2025-01-09 08:20:55,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:55,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:55,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:55,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:55,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:55,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887405067] [2025-01-09 08:20:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887405067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:56,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:56,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434175768] [2025-01-09 08:20:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:56,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:56,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:56,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:56,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:56,251 INFO L87 Difference]: Start difference. First operand 30934 states and 44872 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:56,974 INFO L93 Difference]: Finished difference Result 32783 states and 47536 transitions. [2025-01-09 08:20:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:56,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:57,009 INFO L225 Difference]: With dead ends: 32783 [2025-01-09 08:20:57,009 INFO L226 Difference]: Without dead ends: 30954 [2025-01-09 08:20:57,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:57,024 INFO L435 NwaCegarLoop]: 1867 mSDtfsCounter, 216 mSDsluCounter, 6008 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 7875 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:57,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 7875 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:20:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30954 states. [2025-01-09 08:20:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30954 to 30944. [2025-01-09 08:20:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30944 states, 30943 states have (on average 1.450473451184436) internal successors, (44882), 30943 states have internal predecessors, (44882), 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-01-09 08:20:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30944 states to 30944 states and 44882 transitions. [2025-01-09 08:20:57,329 INFO L78 Accepts]: Start accepts. Automaton has 30944 states and 44882 transitions. Word has length 181 [2025-01-09 08:20:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:57,329 INFO L471 AbstractCegarLoop]: Abstraction has 30944 states and 44882 transitions. [2025-01-09 08:20:57,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 30944 states and 44882 transitions. [2025-01-09 08:20:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:57,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:57,356 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] [2025-01-09 08:20:57,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 08:20:57,356 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:57,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1354761798, now seen corresponding path program 1 times [2025-01-09 08:20:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896388688] [2025-01-09 08:20:57,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:57,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:57,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:57,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:57,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:57,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:57,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896388688] [2025-01-09 08:20:57,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896388688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:20:57,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:20:57,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:20:57,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284638373] [2025-01-09 08:20:57,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:20:57,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:20:57,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:57,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:20:57,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:57,813 INFO L87 Difference]: Start difference. First operand 30944 states and 44882 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:58,552 INFO L93 Difference]: Finished difference Result 35515 states and 51268 transitions. [2025-01-09 08:20:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:20:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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 181 [2025-01-09 08:20:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:58,588 INFO L225 Difference]: With dead ends: 35515 [2025-01-09 08:20:58,588 INFO L226 Difference]: Without dead ends: 33598 [2025-01-09 08:20:58,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:20:58,602 INFO L435 NwaCegarLoop]: 1380 mSDtfsCounter, 1581 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 5439 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:58,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 5439 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:20:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33598 states. [2025-01-09 08:20:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33598 to 31822. [2025-01-09 08:20:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31822 states, 31821 states have (on average 1.4479117563872914) internal successors, (46074), 31821 states have internal predecessors, (46074), 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-01-09 08:20:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31822 states to 31822 states and 46074 transitions. [2025-01-09 08:20:58,933 INFO L78 Accepts]: Start accepts. Automaton has 31822 states and 46074 transitions. Word has length 181 [2025-01-09 08:20:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:58,934 INFO L471 AbstractCegarLoop]: Abstraction has 31822 states and 46074 transitions. [2025-01-09 08:20:58,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 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-01-09 08:20:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 31822 states and 46074 transitions. [2025-01-09 08:20:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:20:59,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:59,047 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] [2025-01-09 08:20:59,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 08:20:59,047 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:59,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:59,048 INFO L85 PathProgramCache]: Analyzing trace with hash -938851822, now seen corresponding path program 1 times [2025-01-09 08:20:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:59,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509707086] [2025-01-09 08:20:59,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:59,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:20:59,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:20:59,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:59,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509707086] [2025-01-09 08:21:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509707086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:21:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051414257] [2025-01-09 08:21:02,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:21:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:02,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:21:02,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:21:02,281 INFO L87 Difference]: Start difference. First operand 31822 states and 46074 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:21:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:03,409 INFO L93 Difference]: Finished difference Result 37695 states and 54238 transitions. [2025-01-09 08:21:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:03,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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 181 [2025-01-09 08:21:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:03,447 INFO L225 Difference]: With dead ends: 37695 [2025-01-09 08:21:03,447 INFO L226 Difference]: Without dead ends: 35446 [2025-01-09 08:21:03,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:21:03,461 INFO L435 NwaCegarLoop]: 1394 mSDtfsCounter, 1695 mSDsluCounter, 4087 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:03,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 5481 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 08:21:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35446 states. [2025-01-09 08:21:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35446 to 33634. [2025-01-09 08:21:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33634 states, 33633 states have (on average 1.4435821960574435) internal successors, (48552), 33633 states have internal predecessors, (48552), 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-01-09 08:21:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33634 states to 33634 states and 48552 transitions. [2025-01-09 08:21:03,794 INFO L78 Accepts]: Start accepts. Automaton has 33634 states and 48552 transitions. Word has length 181 [2025-01-09 08:21:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:03,795 INFO L471 AbstractCegarLoop]: Abstraction has 33634 states and 48552 transitions. [2025-01-09 08:21:03,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:21:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 33634 states and 48552 transitions. [2025-01-09 08:21:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 08:21:03,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:03,902 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] [2025-01-09 08:21:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 08:21:03,902 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -270201172, now seen corresponding path program 1 times [2025-01-09 08:21:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136984605] [2025-01-09 08:21:03,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:03,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 08:21:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 08:21:04,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:04,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136984605] [2025-01-09 08:21:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136984605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:21:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895518362] [2025-01-09 08:21:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:21:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:04,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:21:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:21:04,572 INFO L87 Difference]: Start difference. First operand 33634 states and 48552 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:21:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:04,854 INFO L93 Difference]: Finished difference Result 74615 states and 106806 transitions. [2025-01-09 08:21:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:21:04,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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 181 [2025-01-09 08:21:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:04,916 INFO L225 Difference]: With dead ends: 74615 [2025-01-09 08:21:04,917 INFO L226 Difference]: Without dead ends: 61944 [2025-01-09 08:21:04,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-09 08:21:04,944 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 1882 mSDsluCounter, 6411 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 8018 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:04,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 8018 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:21:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61944 states. [2025-01-09 08:21:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61944 to 33634. [2025-01-09 08:21:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33634 states, 33633 states have (on average 1.4435821960574435) internal successors, (48552), 33633 states have internal predecessors, (48552), 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-01-09 08:21:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33634 states to 33634 states and 48552 transitions. [2025-01-09 08:21:05,369 INFO L78 Accepts]: Start accepts. Automaton has 33634 states and 48552 transitions. Word has length 181 [2025-01-09 08:21:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:05,369 INFO L471 AbstractCegarLoop]: Abstraction has 33634 states and 48552 transitions. [2025-01-09 08:21:05,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 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-01-09 08:21:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33634 states and 48552 transitions. [2025-01-09 08:21:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 08:21:05,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:05,398 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] [2025-01-09 08:21:05,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 08:21:05,399 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:05,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1736486060, now seen corresponding path program 1 times [2025-01-09 08:21:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:05,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584106844] [2025-01-09 08:21:05,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:05,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:21:05,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:21:05,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:05,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:21:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:21:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:21:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584106844] [2025-01-09 08:21:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584106844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:21:06,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:21:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:21:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080737724] [2025-01-09 08:21:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:21:06,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:21:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:21:06,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:21:06,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:21:06,464 INFO L87 Difference]: Start difference. First operand 33634 states and 48552 transitions. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 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-01-09 08:21:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:21:06,645 INFO L93 Difference]: Finished difference Result 36176 states and 52155 transitions. [2025-01-09 08:21:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:21:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 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 182 [2025-01-09 08:21:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:21:06,681 INFO L225 Difference]: With dead ends: 36176 [2025-01-09 08:21:06,681 INFO L226 Difference]: Without dead ends: 33698 [2025-01-09 08:21:06,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:21:06,695 INFO L435 NwaCegarLoop]: 1617 mSDtfsCounter, 25 mSDsluCounter, 6510 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8127 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:21:06,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8127 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:21:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33698 states. [2025-01-09 08:21:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33698 to 33676. [2025-01-09 08:21:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33676 states, 33675 states have (on average 1.44362286562732) internal successors, (48614), 33675 states have internal predecessors, (48614), 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-01-09 08:21:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33676 states to 33676 states and 48614 transitions. [2025-01-09 08:21:07,017 INFO L78 Accepts]: Start accepts. Automaton has 33676 states and 48614 transitions. Word has length 182 [2025-01-09 08:21:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:21:07,017 INFO L471 AbstractCegarLoop]: Abstraction has 33676 states and 48614 transitions. [2025-01-09 08:21:07,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 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-01-09 08:21:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33676 states and 48614 transitions. [2025-01-09 08:21:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 08:21:07,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:07,048 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] [2025-01-09 08:21:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 08:21:07,048 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2008441076, now seen corresponding path program 1 times [2025-01-09 08:21:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:21:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216419334] [2025-01-09 08:21:07,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:21:07,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:21:07,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:21:07,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:07,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:07,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:21:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:21:07,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:21:07,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:07,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:07,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:21:07,507 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:21:07,507 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:21:07,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 08:21:07,511 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-01-09 08:21:07,639 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:21:07,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:21:07 BoogieIcfgContainer [2025-01-09 08:21:07,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:21:07,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:21:07,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:21:07,642 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:21:07,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:20:16" (3/4) ... [2025-01-09 08:21:07,644 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:21:07,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:21:07,645 INFO L158 Benchmark]: Toolchain (without parser) took 56284.42ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 126.7MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 888.3MB. Max. memory is 16.1GB. [2025-01-09 08:21:07,646 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 192.9MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:21:07,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 701.69ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 48.2MB in the end (delta: 78.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 08:21:07,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 429.37ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 48.2MB in the beginning and 82.2MB in the end (delta: -33.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2025-01-09 08:21:07,646 INFO L158 Benchmark]: Boogie Preprocessor took 680.90ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 82.2MB in the beginning and 242.7MB in the end (delta: -160.6MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2025-01-09 08:21:07,646 INFO L158 Benchmark]: RCFGBuilder took 3304.78ms. Allocated memory is still 369.1MB. Free memory was 242.7MB in the beginning and 162.8MB in the end (delta: 79.9MB). Peak memory consumption was 190.8MB. Max. memory is 16.1GB. [2025-01-09 08:21:07,646 INFO L158 Benchmark]: TraceAbstraction took 51158.86ms. Allocated memory was 369.1MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 162.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 714.7MB. Max. memory is 16.1GB. [2025-01-09 08:21:07,647 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 238.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:21:07,648 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 192.9MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 701.69ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 48.2MB in the end (delta: 78.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 429.37ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 48.2MB in the beginning and 82.2MB in the end (delta: -33.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 680.90ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 82.2MB in the beginning and 242.7MB in the end (delta: -160.6MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * RCFGBuilder took 3304.78ms. Allocated memory is still 369.1MB. Free memory was 242.7MB in the beginning and 162.8MB in the end (delta: 79.9MB). Peak memory consumption was 190.8MB. Max. memory is 16.1GB. * TraceAbstraction took 51158.86ms. Allocated memory was 369.1MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 162.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 714.7MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 238.7kB). 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 369, overapproximation of bitwiseAnd at line 467. 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_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 4); [L33] const SORT_26 msb_SORT_26 = (SORT_26)1 << (4 - 1); [L35] const SORT_165 mask_SORT_165 = (SORT_165)-1 >> (sizeof(SORT_165) * 8 - 32); [L36] const SORT_165 msb_SORT_165 = (SORT_165)1 << (32 - 1); [L38] const SORT_196 mask_SORT_196 = (SORT_196)-1 >> (sizeof(SORT_196) * 8 - 3); [L39] const SORT_196 msb_SORT_196 = (SORT_196)1 << (3 - 1); [L41] const SORT_1 var_11 = 0; [L42] const SORT_3 var_14 = 2; [L43] const SORT_1 var_29 = 1; [L44] const SORT_165 var_167 = 1; [L45] const SORT_3 var_250 = 0; [L46] const SORT_3 var_251 = 3; [L47] const SORT_165 var_260 = 0; [L48] const SORT_165 var_471 = 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_186; [L58] SORT_3 input_249; [L59] SORT_3 input_265; [L60] SORT_3 input_266; [L61] SORT_3 input_267; [L62] SORT_3 input_268; [L63] SORT_3 input_295; [L64] SORT_3 input_296; [L65] SORT_3 input_297; [L66] SORT_3 input_306; [L67] SORT_3 input_360; [L68] SORT_3 input_372; [L69] SORT_3 input_373; [L70] SORT_3 input_374; [L71] SORT_3 input_375; [L72] SORT_3 input_384; [L73] SORT_3 input_405; [L74] SORT_3 input_406; [L75] SORT_3 input_407; [L76] SORT_3 input_416; [L77] SORT_3 input_418; [L78] SORT_3 input_464; [L79] SORT_3 input_478; [L80] SORT_3 input_479; [L81] SORT_3 input_480; [L82] SORT_3 input_481; [L83] SORT_3 input_490; [L84] SORT_3 input_492; [L85] SORT_3 input_514; [L86] SORT_3 input_515; [L87] SORT_3 input_516; [L88] SORT_3 input_525; [L89] SORT_3 input_527; [L90] SORT_3 input_529; [L91] SORT_3 input_575; [L92] SORT_3 input_586; [L93] SORT_3 input_587; [L94] SORT_3 input_588; [L95] SORT_3 input_596; [L96] SORT_3 input_598; [L97] SORT_3 input_600; [L98] SORT_3 input_620; [L99] SORT_3 input_621; [L100] SORT_3 input_629; [L101] SORT_3 input_631; [L102] SORT_3 input_633; [L103] SORT_3 input_635; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_26=15, mask_SORT_3=3, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L105] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_26=15, mask_SORT_3=3, state_10=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L106] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_26=15, mask_SORT_3=3, state_10=0, state_13=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L107] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_26=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L108] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_26=15, mask_SORT_3=3, state_10=0, state_13=0, state_16=0, state_19=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L109] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_26 VAL [mask_SORT_196=7, mask_SORT_1=1, 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_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L110] SORT_26 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_26; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L111] SORT_3 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L112] SORT_3 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L113] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L114] SORT_3 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L115] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L116] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L117] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L118] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L119] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L120] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L121] SORT_3 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L122] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=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_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L123] SORT_3 state_127 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L124] SORT_3 state_128 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L125] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L126] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L126] SORT_3 state_130 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L127] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L127] SORT_3 state_131 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L128] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L128] SORT_3 state_132 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L129] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L129] SORT_3 state_133 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L130] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L130] SORT_3 state_134 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L131] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L131] SORT_3 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L132] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L132] SORT_3 state_136 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L133] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L133] SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L134] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L134] SORT_3 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L135] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L135] SORT_3 state_139 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L136] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L136] SORT_3 state_140 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L137] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L137] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L138] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L138] SORT_3 state_142 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L142] input_2 = __VERIFIER_nondet_uchar() [L143] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L143] input_2 = input_2 & mask_SORT_1 [L144] input_4 = __VERIFIER_nondet_uchar() [L145] input_5 = __VERIFIER_nondet_uchar() [L146] input_6 = __VERIFIER_nondet_uchar() [L147] input_7 = __VERIFIER_nondet_uchar() [L148] input_8 = __VERIFIER_nondet_uchar() [L149] input_9 = __VERIFIER_nondet_uchar() [L150] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_10=0, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L150] input_9 = input_9 & mask_SORT_1 [L151] input_186 = __VERIFIER_nondet_uchar() [L152] input_249 = __VERIFIER_nondet_uchar() [L153] input_265 = __VERIFIER_nondet_uchar() [L154] input_266 = __VERIFIER_nondet_uchar() [L155] input_267 = __VERIFIER_nondet_uchar() [L156] input_268 = __VERIFIER_nondet_uchar() [L157] input_295 = __VERIFIER_nondet_uchar() [L158] input_296 = __VERIFIER_nondet_uchar() [L159] input_297 = __VERIFIER_nondet_uchar() [L160] input_306 = __VERIFIER_nondet_uchar() [L161] input_360 = __VERIFIER_nondet_uchar() [L162] input_372 = __VERIFIER_nondet_uchar() [L163] input_373 = __VERIFIER_nondet_uchar() [L164] input_374 = __VERIFIER_nondet_uchar() [L165] input_375 = __VERIFIER_nondet_uchar() [L166] input_384 = __VERIFIER_nondet_uchar() [L167] input_405 = __VERIFIER_nondet_uchar() [L168] input_406 = __VERIFIER_nondet_uchar() [L169] input_407 = __VERIFIER_nondet_uchar() [L170] input_416 = __VERIFIER_nondet_uchar() [L171] input_418 = __VERIFIER_nondet_uchar() [L172] input_464 = __VERIFIER_nondet_uchar() [L173] input_478 = __VERIFIER_nondet_uchar() [L174] input_479 = __VERIFIER_nondet_uchar() [L175] input_480 = __VERIFIER_nondet_uchar() [L176] input_481 = __VERIFIER_nondet_uchar() [L177] input_490 = __VERIFIER_nondet_uchar() [L178] input_492 = __VERIFIER_nondet_uchar() [L179] input_514 = __VERIFIER_nondet_uchar() [L180] input_515 = __VERIFIER_nondet_uchar() [L181] input_516 = __VERIFIER_nondet_uchar() [L182] input_525 = __VERIFIER_nondet_uchar() [L183] input_527 = __VERIFIER_nondet_uchar() [L184] input_529 = __VERIFIER_nondet_uchar() [L185] input_575 = __VERIFIER_nondet_uchar() [L186] input_586 = __VERIFIER_nondet_uchar() [L187] input_587 = __VERIFIER_nondet_uchar() [L188] input_588 = __VERIFIER_nondet_uchar() [L189] input_596 = __VERIFIER_nondet_uchar() [L190] input_598 = __VERIFIER_nondet_uchar() [L191] input_600 = __VERIFIER_nondet_uchar() [L192] input_620 = __VERIFIER_nondet_uchar() [L193] input_621 = __VERIFIER_nondet_uchar() [L194] input_629 = __VERIFIER_nondet_uchar() [L195] input_631 = __VERIFIER_nondet_uchar() [L196] input_633 = __VERIFIER_nondet_uchar() [L197] input_635 = __VERIFIER_nondet_uchar() [L200] SORT_1 var_12_arg_0 = state_10; [L201] SORT_1 var_12_arg_1 = var_11; [L202] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L203] SORT_3 var_15_arg_0 = state_13; [L204] SORT_3 var_15_arg_1 = var_14; [L205] SORT_1 var_15 = var_15_arg_0 >= var_15_arg_1; [L206] SORT_3 var_17_arg_0 = state_16; [L207] SORT_3 var_17_arg_1 = var_14; [L208] SORT_1 var_17 = var_17_arg_0 >= var_17_arg_1; [L209] SORT_1 var_18_arg_0 = var_15; [L210] SORT_1 var_18_arg_1 = var_17; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_18_arg_0=0, var_18_arg_1=0, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L211] EXPR var_18_arg_0 & var_18_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L211] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L212] SORT_3 var_20_arg_0 = state_19; [L213] SORT_3 var_20_arg_1 = var_14; [L214] SORT_1 var_20 = var_20_arg_0 >= var_20_arg_1; [L215] SORT_1 var_21_arg_0 = var_18; [L216] SORT_1 var_21_arg_1 = var_20; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_21_arg_0=0, var_21_arg_1=0, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L217] EXPR var_21_arg_0 & var_21_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L217] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L218] SORT_3 var_23_arg_0 = state_22; [L219] SORT_3 var_23_arg_1 = var_14; [L220] SORT_1 var_23 = var_23_arg_0 >= var_23_arg_1; [L221] SORT_1 var_24_arg_0 = var_21; [L222] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_24_arg_0=0, var_24_arg_1=0, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L223] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_29=1, var_471=2] [L223] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L224] SORT_1 var_25_arg_0 = var_24; [L225] SORT_1 var_25 = ~var_25_arg_0; [L226] SORT_26 var_28_arg_0 = state_27; [L227] SORT_1 var_28 = var_28_arg_0 >> 3; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_25=-1, var_260=0, var_28=0, var_29=1, var_471=2] [L228] EXPR var_28 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_25=-1, var_260=0, var_29=1, var_471=2] [L228] var_28 = var_28 & mask_SORT_1 [L229] SORT_1 var_30_arg_0 = var_28; [L230] SORT_1 var_30_arg_1 = var_29; [L231] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L232] SORT_1 var_31_arg_0 = var_25; [L233] SORT_1 var_31_arg_1 = var_30; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31_arg_0=-1, var_31_arg_1=0, var_471=2] [L234] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_471=2] [L234] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L235] SORT_3 var_33_arg_0 = state_32; [L236] SORT_3 var_33_arg_1 = var_14; [L237] SORT_1 var_33 = var_33_arg_0 >= var_33_arg_1; [L238] SORT_3 var_35_arg_0 = state_34; [L239] SORT_3 var_35_arg_1 = var_14; [L240] SORT_1 var_35 = var_35_arg_0 >= var_35_arg_1; [L241] SORT_1 var_36_arg_0 = var_33; [L242] SORT_1 var_36_arg_1 = var_35; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_36_arg_0=0, var_36_arg_1=0, var_471=2] [L243] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_471=2] [L243] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L244] SORT_3 var_38_arg_0 = state_37; [L245] SORT_3 var_38_arg_1 = var_14; [L246] SORT_1 var_38 = var_38_arg_0 >= var_38_arg_1; [L247] SORT_1 var_39_arg_0 = var_36; [L248] SORT_1 var_39_arg_1 = var_38; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_39_arg_0=0, var_39_arg_1=0, var_471=2] [L249] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_471=2] [L249] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L250] SORT_3 var_41_arg_0 = state_40; [L251] SORT_3 var_41_arg_1 = var_14; [L252] SORT_1 var_41 = var_41_arg_0 >= var_41_arg_1; [L253] SORT_1 var_42_arg_0 = var_39; [L254] SORT_1 var_42_arg_1 = var_41; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_42_arg_0=0, var_42_arg_1=0, var_471=2] [L255] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_471=2] [L255] SORT_1 var_42 = var_42_arg_0 & var_42_arg_1; [L256] SORT_1 var_43_arg_0 = var_42; [L257] SORT_1 var_43 = ~var_43_arg_0; [L258] SORT_26 var_44_arg_0 = state_27; [L259] SORT_1 var_44 = var_44_arg_0 >> 2; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_43=-1, var_44=0, var_471=2] [L260] EXPR var_44 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_43=-1, var_471=2] [L260] var_44 = var_44 & mask_SORT_1 [L261] SORT_1 var_45_arg_0 = var_44; [L262] SORT_1 var_45_arg_1 = var_29; [L263] SORT_1 var_45 = var_45_arg_0 >= var_45_arg_1; [L264] SORT_1 var_46_arg_0 = var_43; [L265] SORT_1 var_46_arg_1 = var_45; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_44=0, var_46_arg_0=-1, var_46_arg_1=0, var_471=2] [L266] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_31=255, var_44=0, var_471=2] [L266] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L267] SORT_1 var_47_arg_0 = var_31; [L268] SORT_1 var_47_arg_1 = var_46; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47_arg_0=255, var_47_arg_1=255] [L269] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2] [L269] SORT_1 var_47 = var_47_arg_0 & var_47_arg_1; [L270] SORT_3 var_49_arg_0 = state_48; [L271] SORT_3 var_49_arg_1 = var_14; [L272] SORT_1 var_49 = var_49_arg_0 >= var_49_arg_1; [L273] SORT_3 var_51_arg_0 = state_50; [L274] SORT_3 var_51_arg_1 = var_14; [L275] SORT_1 var_51 = var_51_arg_0 >= var_51_arg_1; [L276] SORT_1 var_52_arg_0 = var_49; [L277] SORT_1 var_52_arg_1 = var_51; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255, var_52_arg_0=0, var_52_arg_1=0] [L278] EXPR var_52_arg_0 & var_52_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255] [L278] SORT_1 var_52 = var_52_arg_0 & var_52_arg_1; [L279] SORT_3 var_54_arg_0 = state_53; [L280] SORT_3 var_54_arg_1 = var_14; [L281] SORT_1 var_54 = var_54_arg_0 >= var_54_arg_1; [L282] SORT_1 var_55_arg_0 = var_52; [L283] SORT_1 var_55_arg_1 = var_54; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255, var_55_arg_0=0, var_55_arg_1=0] [L284] EXPR var_55_arg_0 & var_55_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255] [L284] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L285] SORT_3 var_57_arg_0 = state_56; [L286] SORT_3 var_57_arg_1 = var_14; [L287] SORT_1 var_57 = var_57_arg_0 >= var_57_arg_1; [L288] SORT_1 var_58_arg_0 = var_55; [L289] SORT_1 var_58_arg_1 = var_57; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255, var_58_arg_0=0, var_58_arg_1=0] [L290] EXPR var_58_arg_0 & var_58_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255] [L290] SORT_1 var_58 = var_58_arg_0 & var_58_arg_1; [L291] SORT_1 var_59_arg_0 = var_58; [L292] SORT_1 var_59 = ~var_59_arg_0; [L293] SORT_26 var_60_arg_0 = state_27; [L294] SORT_1 var_60 = var_60_arg_0 >> 1; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255, var_59=-1, var_60=0] [L295] EXPR var_60 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255, var_59=-1] [L295] var_60 = var_60 & mask_SORT_1 [L296] SORT_1 var_61_arg_0 = var_60; [L297] SORT_1 var_61_arg_1 = var_29; [L298] SORT_1 var_61 = var_61_arg_0 >= var_61_arg_1; [L299] SORT_1 var_62_arg_0 = var_59; [L300] SORT_1 var_62_arg_1 = var_61; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255, var_60=0, var_62_arg_0=-1, var_62_arg_1=0] [L301] EXPR var_62_arg_0 | var_62_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_47=255, var_60=0] [L301] SORT_1 var_62 = var_62_arg_0 | var_62_arg_1; [L302] SORT_1 var_63_arg_0 = var_47; [L303] SORT_1 var_63_arg_1 = var_62; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63_arg_0=255, var_63_arg_1=255] [L304] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0] [L304] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L305] SORT_3 var_65_arg_0 = state_64; [L306] SORT_3 var_65_arg_1 = var_14; [L307] SORT_1 var_65 = var_65_arg_0 >= var_65_arg_1; [L308] SORT_3 var_67_arg_0 = state_66; [L309] SORT_3 var_67_arg_1 = var_14; [L310] SORT_1 var_67 = var_67_arg_0 >= var_67_arg_1; [L311] SORT_1 var_68_arg_0 = var_65; [L312] SORT_1 var_68_arg_1 = var_67; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255, var_68_arg_0=0, var_68_arg_1=0] [L313] EXPR var_68_arg_0 & var_68_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255] [L313] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L314] SORT_3 var_70_arg_0 = state_69; [L315] SORT_3 var_70_arg_1 = var_14; [L316] SORT_1 var_70 = var_70_arg_0 >= var_70_arg_1; [L317] SORT_1 var_71_arg_0 = var_68; [L318] SORT_1 var_71_arg_1 = var_70; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255, var_71_arg_0=0, var_71_arg_1=0] [L319] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255] [L319] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L320] SORT_3 var_73_arg_0 = state_72; [L321] SORT_3 var_73_arg_1 = var_14; [L322] SORT_1 var_73 = var_73_arg_0 >= var_73_arg_1; [L323] SORT_1 var_74_arg_0 = var_71; [L324] SORT_1 var_74_arg_1 = var_73; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255, var_74_arg_0=0, var_74_arg_1=0] [L325] EXPR var_74_arg_0 & var_74_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_27=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255] [L325] SORT_1 var_74 = var_74_arg_0 & var_74_arg_1; [L326] SORT_1 var_75_arg_0 = var_74; [L327] SORT_1 var_75 = ~var_75_arg_0; [L328] SORT_26 var_76_arg_0 = state_27; [L329] SORT_1 var_76 = var_76_arg_0 >> 0; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255, var_75=-1, var_76=0] [L330] EXPR var_76 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255, var_75=-1] [L330] var_76 = var_76 & mask_SORT_1 [L331] SORT_1 var_77_arg_0 = var_76; [L332] SORT_1 var_77_arg_1 = var_29; [L333] SORT_1 var_77 = var_77_arg_0 >= var_77_arg_1; [L334] SORT_1 var_78_arg_0 = var_75; [L335] SORT_1 var_78_arg_1 = var_77; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255, var_76=0, var_78_arg_0=-1, var_78_arg_1=0] [L336] EXPR var_78_arg_0 | var_78_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_63=255, var_76=0] [L336] SORT_1 var_78 = var_78_arg_0 | var_78_arg_1; [L337] SORT_1 var_79_arg_0 = var_63; [L338] SORT_1 var_79_arg_1 = var_78; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79_arg_0=255, var_79_arg_1=255] [L339] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_13=0, state_140=0, state_141=0, state_142=0, state_16=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L339] SORT_1 var_79 = var_79_arg_0 & var_79_arg_1; [L340] SORT_3 var_80_arg_0 = state_13; [L341] SORT_3 var_80_arg_1 = var_14; [L342] SORT_1 var_80 = var_80_arg_0 >= var_80_arg_1; [L343] SORT_3 var_81_arg_0 = state_16; [L344] SORT_3 var_81_arg_1 = var_14; [L345] SORT_1 var_81 = var_81_arg_0 >= var_81_arg_1; [L346] SORT_1 var_82_arg_0 = var_80; [L347] SORT_1 var_82_arg_1 = var_81; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255, var_82_arg_0=0, var_82_arg_1=0] [L348] EXPR var_82_arg_0 | var_82_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_19=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255] [L348] SORT_1 var_82 = var_82_arg_0 | var_82_arg_1; [L349] SORT_3 var_83_arg_0 = state_19; [L350] SORT_3 var_83_arg_1 = var_14; [L351] SORT_1 var_83 = var_83_arg_0 >= var_83_arg_1; [L352] SORT_1 var_84_arg_0 = var_82; [L353] SORT_1 var_84_arg_1 = var_83; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255, var_84_arg_0=0, var_84_arg_1=0] [L354] EXPR var_84_arg_0 | var_84_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_22=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255] [L354] SORT_1 var_84 = var_84_arg_0 | var_84_arg_1; [L355] SORT_3 var_85_arg_0 = state_22; [L356] SORT_3 var_85_arg_1 = var_14; [L357] SORT_1 var_85 = var_85_arg_0 >= var_85_arg_1; [L358] SORT_1 var_86_arg_0 = var_84; [L359] SORT_1 var_86_arg_1 = var_85; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255, var_86_arg_0=0, var_86_arg_1=0] [L360] EXPR var_86_arg_0 | var_86_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255] [L360] SORT_1 var_86 = var_86_arg_0 | var_86_arg_1; [L361] SORT_1 var_87_arg_0 = var_28; [L362] SORT_1 var_87_arg_1 = var_11; [L363] SORT_1 var_87 = var_87_arg_0 == var_87_arg_1; [L364] SORT_1 var_88_arg_0 = var_86; [L365] SORT_1 var_88_arg_1 = var_87; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255, var_88_arg_0=0, var_88_arg_1=1] [L366] EXPR var_88_arg_0 | var_88_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_79=255] [L366] SORT_1 var_88 = var_88_arg_0 | var_88_arg_1; [L367] SORT_1 var_89_arg_0 = var_79; [L368] SORT_1 var_89_arg_1 = var_88; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89_arg_0=255, var_89_arg_1=1] [L369] EXPR var_89_arg_0 & var_89_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_32=0, state_34=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L369] SORT_1 var_89 = var_89_arg_0 & var_89_arg_1; [L370] SORT_3 var_90_arg_0 = state_32; [L371] SORT_3 var_90_arg_1 = var_14; [L372] SORT_1 var_90 = var_90_arg_0 >= var_90_arg_1; [L373] SORT_3 var_91_arg_0 = state_34; [L374] SORT_3 var_91_arg_1 = var_14; [L375] SORT_1 var_91 = var_91_arg_0 >= var_91_arg_1; [L376] SORT_1 var_92_arg_0 = var_90; [L377] SORT_1 var_92_arg_1 = var_91; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0, var_92_arg_0=0, var_92_arg_1=0] [L378] EXPR var_92_arg_0 | var_92_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_37=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0] [L378] SORT_1 var_92 = var_92_arg_0 | var_92_arg_1; [L379] SORT_3 var_93_arg_0 = state_37; [L380] SORT_3 var_93_arg_1 = var_14; [L381] SORT_1 var_93 = var_93_arg_0 >= var_93_arg_1; [L382] SORT_1 var_94_arg_0 = var_92; [L383] SORT_1 var_94_arg_1 = var_93; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0, var_94_arg_0=0, var_94_arg_1=0] [L384] EXPR var_94_arg_0 | var_94_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_40=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0] [L384] SORT_1 var_94 = var_94_arg_0 | var_94_arg_1; [L385] SORT_3 var_95_arg_0 = state_40; [L386] SORT_3 var_95_arg_1 = var_14; [L387] SORT_1 var_95 = var_95_arg_0 >= var_95_arg_1; [L388] SORT_1 var_96_arg_0 = var_94; [L389] SORT_1 var_96_arg_1 = var_95; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0, var_96_arg_0=0, var_96_arg_1=0] [L390] EXPR var_96_arg_0 | var_96_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0] [L390] SORT_1 var_96 = var_96_arg_0 | var_96_arg_1; [L391] SORT_1 var_97_arg_0 = var_44; [L392] SORT_1 var_97_arg_1 = var_11; [L393] SORT_1 var_97 = var_97_arg_0 == var_97_arg_1; [L394] SORT_1 var_98_arg_0 = var_96; [L395] SORT_1 var_98_arg_1 = var_97; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0, var_98_arg_0=0, var_98_arg_1=1] [L396] EXPR var_98_arg_0 | var_98_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_89=0] [L396] SORT_1 var_98 = var_98_arg_0 | var_98_arg_1; [L397] SORT_1 var_99_arg_0 = var_89; [L398] SORT_1 var_99_arg_1 = var_98; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99_arg_0=0, var_99_arg_1=1] [L399] EXPR var_99_arg_0 & var_99_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_48=0, state_50=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L399] SORT_1 var_99 = var_99_arg_0 & var_99_arg_1; [L400] SORT_3 var_100_arg_0 = state_48; [L401] SORT_3 var_100_arg_1 = var_14; [L402] SORT_1 var_100 = var_100_arg_0 >= var_100_arg_1; [L403] SORT_3 var_101_arg_0 = state_50; [L404] SORT_3 var_101_arg_1 = var_14; [L405] SORT_1 var_101 = var_101_arg_0 >= var_101_arg_1; [L406] SORT_1 var_102_arg_0 = var_100; [L407] SORT_1 var_102_arg_1 = var_101; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_102_arg_0=0, var_102_arg_1=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L408] EXPR var_102_arg_0 | var_102_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_53=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L408] SORT_1 var_102 = var_102_arg_0 | var_102_arg_1; [L409] SORT_3 var_103_arg_0 = state_53; [L410] SORT_3 var_103_arg_1 = var_14; [L411] SORT_1 var_103 = var_103_arg_0 >= var_103_arg_1; [L412] SORT_1 var_104_arg_0 = var_102; [L413] SORT_1 var_104_arg_1 = var_103; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_104_arg_0=0, var_104_arg_1=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L414] EXPR var_104_arg_0 | var_104_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_56=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L414] SORT_1 var_104 = var_104_arg_0 | var_104_arg_1; [L415] SORT_3 var_105_arg_0 = state_56; [L416] SORT_3 var_105_arg_1 = var_14; [L417] SORT_1 var_105 = var_105_arg_0 >= var_105_arg_1; [L418] SORT_1 var_106_arg_0 = var_104; [L419] SORT_1 var_106_arg_1 = var_105; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_64=0, state_66=0, state_69=0, state_72=0, var_106_arg_0=0, var_106_arg_1=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L420] EXPR var_106_arg_0 | var_106_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L420] SORT_1 var_106 = var_106_arg_0 | var_106_arg_1; [L421] SORT_1 var_107_arg_0 = var_60; [L422] SORT_1 var_107_arg_1 = var_11; [L423] SORT_1 var_107 = var_107_arg_0 == var_107_arg_1; [L424] SORT_1 var_108_arg_0 = var_106; [L425] SORT_1 var_108_arg_1 = var_107; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_64=0, state_66=0, state_69=0, state_72=0, var_108_arg_0=0, var_108_arg_1=1, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L426] EXPR var_108_arg_0 | var_108_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0, var_99=0] [L426] SORT_1 var_108 = var_108_arg_0 | var_108_arg_1; [L427] SORT_1 var_109_arg_0 = var_99; [L428] SORT_1 var_109_arg_1 = var_108; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_64=0, state_66=0, state_69=0, state_72=0, var_109_arg_0=0, var_109_arg_1=1, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L429] EXPR var_109_arg_0 & var_109_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_64=0, state_66=0, state_69=0, state_72=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L429] SORT_1 var_109 = var_109_arg_0 & var_109_arg_1; [L430] SORT_3 var_110_arg_0 = state_64; [L431] SORT_3 var_110_arg_1 = var_14; [L432] SORT_1 var_110 = var_110_arg_0 >= var_110_arg_1; [L433] SORT_3 var_111_arg_0 = state_66; [L434] SORT_3 var_111_arg_1 = var_14; [L435] SORT_1 var_111 = var_111_arg_0 >= var_111_arg_1; [L436] SORT_1 var_112_arg_0 = var_110; [L437] SORT_1 var_112_arg_1 = var_111; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_69=0, state_72=0, var_109=0, var_112_arg_0=0, var_112_arg_1=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L438] EXPR var_112_arg_0 | var_112_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_69=0, state_72=0, var_109=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L438] SORT_1 var_112 = var_112_arg_0 | var_112_arg_1; [L439] SORT_3 var_113_arg_0 = state_69; [L440] SORT_3 var_113_arg_1 = var_14; [L441] SORT_1 var_113 = var_113_arg_0 >= var_113_arg_1; [L442] SORT_1 var_114_arg_0 = var_112; [L443] SORT_1 var_114_arg_1 = var_113; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_72=0, var_109=0, var_114_arg_0=0, var_114_arg_1=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L444] EXPR var_114_arg_0 | var_114_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, state_72=0, var_109=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L444] SORT_1 var_114 = var_114_arg_0 | var_114_arg_1; [L445] SORT_3 var_115_arg_0 = state_72; [L446] SORT_3 var_115_arg_1 = var_14; [L447] SORT_1 var_115 = var_115_arg_0 >= var_115_arg_1; [L448] SORT_1 var_116_arg_0 = var_114; [L449] SORT_1 var_116_arg_1 = var_115; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_109=0, var_116_arg_0=0, var_116_arg_1=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L450] EXPR var_116_arg_0 | var_116_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_109=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L450] SORT_1 var_116 = var_116_arg_0 | var_116_arg_1; [L451] SORT_1 var_117_arg_0 = var_76; [L452] SORT_1 var_117_arg_1 = var_11; [L453] SORT_1 var_117 = var_117_arg_0 == var_117_arg_1; [L454] SORT_1 var_118_arg_0 = var_116; [L455] SORT_1 var_118_arg_1 = var_117; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_109=0, var_118_arg_0=0, var_118_arg_1=1, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L456] EXPR var_118_arg_0 | var_118_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_109=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L456] SORT_1 var_118 = var_118_arg_0 | var_118_arg_1; [L457] SORT_1 var_119_arg_0 = var_109; [L458] SORT_1 var_119_arg_1 = var_118; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_119_arg_0=0, var_119_arg_1=1, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L459] EXPR var_119_arg_0 & var_119_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_11=0, var_12=1, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L459] SORT_1 var_119 = var_119_arg_0 & var_119_arg_1; [L460] SORT_1 var_120_arg_0 = var_12; [L461] SORT_1 var_120_arg_1 = var_119; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_11=0, var_120_arg_0=1, var_120_arg_1=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L462] EXPR var_120_arg_0 | var_120_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L462] SORT_1 var_120 = var_120_arg_0 | var_120_arg_1; [L463] SORT_1 var_123_arg_0 = var_120; [L464] SORT_1 var_123 = ~var_123_arg_0; [L465] SORT_1 var_124_arg_0 = var_29; [L466] SORT_1 var_124_arg_1 = var_123; VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_11=0, var_124_arg_0=1, var_124_arg_1=-2, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L467] EXPR var_124_arg_0 & var_124_arg_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L467] SORT_1 var_124 = var_124_arg_0 & var_124_arg_1; [L468] EXPR var_124 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_196=7, mask_SORT_1=1, mask_SORT_3=3, state_127=0, state_128=0, state_129=0, state_130=0, state_131=0, state_132=0, state_133=0, state_134=0, state_135=0, state_136=0, state_137=0, state_138=0, state_139=0, state_140=0, state_141=0, state_142=0, var_11=0, var_14=2, var_167=1, var_250=0, var_251=3, var_260=0, var_28=0, var_29=1, var_44=0, var_471=2, var_60=0, var_76=0] [L468] var_124 = var_124 & mask_SORT_1 [L469] SORT_1 bad_125_arg_0 = var_124; [L470] CALL __VERIFIER_assert(!(bad_125_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1094 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.9s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45631 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45631 mSDsluCounter, 422397 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336441 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15494 IncrementalHoareTripleChecker+Invalid, 15578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 85956 mSDtfsCounter, 15494 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33676occurred in iteration=53, InterpolantAutomatonStates: 363, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 53 MinimizatonAttempts, 79937 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 9607 NumberOfCodeBlocks, 9607 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 9372 ConstructedInterpolants, 0 QuantifiedInterpolants, 27103 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-01-09 08:21:07,676 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_p3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 404ac2bd3423bef5ce605181ef24be34b1a7af016e0b24dd5c9fcdb327055474 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:21:10,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:21:10,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:21:10,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:21:10,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:21:10,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:21:10,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:21:10,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:21:10,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:21:10,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:21:10,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:21:10,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:21:10,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:21:10,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:21:10,262 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:21:10,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:21:10,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:21:10,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:21:10,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:10,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:21:10,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:10,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:21:10,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:21:10,264 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 -> 404ac2bd3423bef5ce605181ef24be34b1a7af016e0b24dd5c9fcdb327055474 [2025-01-09 08:21:10,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:21:10,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:21:10,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:21:10,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:21:10,526 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:21:10,527 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_p3.c [2025-01-09 08:21:11,709 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f32f14cd/88d8703375dd488dbc18dcfd76954e95/FLAG64c311292 [2025-01-09 08:21:12,047 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:21:12,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_bpbs_p3.c [2025-01-09 08:21:12,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f32f14cd/88d8703375dd488dbc18dcfd76954e95/FLAG64c311292 [2025-01-09 08:21:12,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f32f14cd/88d8703375dd488dbc18dcfd76954e95 [2025-01-09 08:21:12,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:21:12,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:21:12,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:21:12,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:21:12,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:21:12,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:21:12" (1/1) ... [2025-01-09 08:21:12,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d58739e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:12, skipping insertion in model container [2025-01-09 08:21:12,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:21:12" (1/1) ... [2025-01-09 08:21:12,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:21:12,503 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_p3.c[1258,1271] [2025-01-09 08:21:12,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:21:12,785 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:21:12,809 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_p3.c[1258,1271] [2025-01-09 08:21:12,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:21:13,002 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:21:13,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13 WrapperNode [2025-01-09 08:21:13,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:21:13,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:21:13,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:21:13,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:21:13,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,111 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2278 [2025-01-09 08:21:13,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:21:13,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:21:13,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:21:13,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:21:13,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,179 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-01-09 08:21:13,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:21:13,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:21:13,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:21:13,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:21:13,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (1/1) ... [2025-01-09 08:21:13,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:21:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:13,310 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-01-09 08:21:13,318 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-01-09 08:21:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:21:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:21:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:21:13,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:21:13,645 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:21:13,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:21:15,204 INFO L? ?]: Removed 344 outVars from TransFormulas that were not future-live. [2025-01-09 08:21:15,205 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:21:15,215 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:21:15,215 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:21:15,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:15 BoogieIcfgContainer [2025-01-09 08:21:15,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:21:15,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:21:15,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:21:15,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:21:15,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:21:12" (1/3) ... [2025-01-09 08:21:15,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4299ffee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:15, skipping insertion in model container [2025-01-09 08:21:15,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:21:13" (2/3) ... [2025-01-09 08:21:15,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4299ffee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:21:15, skipping insertion in model container [2025-01-09 08:21:15,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:15" (3/3) ... [2025-01-09 08:21:15,222 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_bpbs_p3.c [2025-01-09 08:21:15,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:21:15,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_bpbs_p3.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:21:15,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:21:15,265 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;@7cc43cef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:21:15,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:21:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-01-09 08:21:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:21:15,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:21:15,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:21:15,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:21:15,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:21:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:21:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:21:15,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771555131] [2025-01-09 08:21:15,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:21:15,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:15,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:21:15,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:21:15,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:21:15,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:21:15,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:21:15,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:15,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:15,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:21:15,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:21:15,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:21:15,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:21:15,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:21:16,100 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-09 08:21:16,106 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:21:16,107 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:21:16,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:21:16,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:21:16,320 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 08:21:16,361 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:21:16,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:21:16 BoogieIcfgContainer [2025-01-09 08:21:16,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:21:16,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:21:16,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:21:16,369 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:21:16,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:21:15" (3/4) ... [2025-01-09 08:21:16,373 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 08:21:16,460 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-01-09 08:21:16,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 08:21:16,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 08:21:16,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:21:16,497 INFO L158 Benchmark]: Toolchain (without parser) took 4196.89ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 89.8MB in the beginning and 122.5MB in the end (delta: -32.8MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. [2025-01-09 08:21:16,498 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 62.9MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:21:16,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.37ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 77.5MB in the end (delta: 12.0MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2025-01-09 08:21:16,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.04ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 61.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:21:16,498 INFO L158 Benchmark]: Boogie Preprocessor took 165.08ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 68.1MB in the end (delta: -6.6MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2025-01-09 08:21:16,498 INFO L158 Benchmark]: RCFGBuilder took 1930.29ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 68.1MB in the beginning and 221.8MB in the end (delta: -153.7MB). Peak memory consumption was 189.9MB. Max. memory is 16.1GB. [2025-01-09 08:21:16,499 INFO L158 Benchmark]: TraceAbstraction took 1150.89ms. Allocated memory is still 318.8MB. Free memory was 221.8MB in the beginning and 134.4MB in the end (delta: 87.4MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-01-09 08:21:16,499 INFO L158 Benchmark]: Witness Printer took 128.04ms. Allocated memory is still 318.8MB. Free memory was 134.4MB in the beginning and 122.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:21:16,500 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.16ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 62.9MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.37ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 77.5MB in the end (delta: 12.0MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.04ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 61.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.08ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 68.1MB in the end (delta: -6.6MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1930.29ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 68.1MB in the beginning and 221.8MB in the end (delta: -153.7MB). Peak memory consumption was 189.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1150.89ms. Allocated memory is still 318.8MB. Free memory was 221.8MB in the beginning and 134.4MB in the end (delta: 87.4MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * Witness Printer took 128.04ms. Allocated memory is still 318.8MB. Free memory was 134.4MB in the beginning and 122.5MB in the end (delta: 11.9MB). 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a 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_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 4); [L33] const SORT_26 msb_SORT_26 = (SORT_26)1 << (4 - 1); [L35] const SORT_165 mask_SORT_165 = (SORT_165)-1 >> (sizeof(SORT_165) * 8 - 32); [L36] const SORT_165 msb_SORT_165 = (SORT_165)1 << (32 - 1); [L38] const SORT_196 mask_SORT_196 = (SORT_196)-1 >> (sizeof(SORT_196) * 8 - 3); [L39] const SORT_196 msb_SORT_196 = (SORT_196)1 << (3 - 1); [L41] const SORT_1 var_11 = 0; [L42] const SORT_3 var_14 = 2; [L43] const SORT_1 var_29 = 1; [L44] const SORT_165 var_167 = 1; [L45] const SORT_3 var_250 = 0; [L46] const SORT_3 var_251 = 3; [L47] const SORT_165 var_260 = 0; [L48] const SORT_165 var_471 = 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_186; [L58] SORT_3 input_249; [L59] SORT_3 input_265; [L60] SORT_3 input_266; [L61] SORT_3 input_267; [L62] SORT_3 input_268; [L63] SORT_3 input_295; [L64] SORT_3 input_296; [L65] SORT_3 input_297; [L66] SORT_3 input_306; [L67] SORT_3 input_360; [L68] SORT_3 input_372; [L69] SORT_3 input_373; [L70] SORT_3 input_374; [L71] SORT_3 input_375; [L72] SORT_3 input_384; [L73] SORT_3 input_405; [L74] SORT_3 input_406; [L75] SORT_3 input_407; [L76] SORT_3 input_416; [L77] SORT_3 input_418; [L78] SORT_3 input_464; [L79] SORT_3 input_478; [L80] SORT_3 input_479; [L81] SORT_3 input_480; [L82] SORT_3 input_481; [L83] SORT_3 input_490; [L84] SORT_3 input_492; [L85] SORT_3 input_514; [L86] SORT_3 input_515; [L87] SORT_3 input_516; [L88] SORT_3 input_525; [L89] SORT_3 input_527; [L90] SORT_3 input_529; [L91] SORT_3 input_575; [L92] SORT_3 input_586; [L93] SORT_3 input_587; [L94] SORT_3 input_588; [L95] SORT_3 input_596; [L96] SORT_3 input_598; [L97] SORT_3 input_600; [L98] SORT_3 input_620; [L99] SORT_3 input_621; [L100] SORT_3 input_629; [L101] SORT_3 input_631; [L102] SORT_3 input_633; [L103] SORT_3 input_635; [L105] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L107] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L108] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L109] SORT_3 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L110] SORT_26 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_26; [L111] SORT_3 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L112] SORT_3 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L113] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L114] SORT_3 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L115] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L116] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L117] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L118] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L119] SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L120] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L121] SORT_3 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L122] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L123] SORT_3 state_127 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L124] SORT_3 state_128 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L125] SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L126] SORT_3 state_130 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L127] SORT_3 state_131 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L128] SORT_3 state_132 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L129] SORT_3 state_133 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L130] SORT_3 state_134 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L131] SORT_3 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L132] SORT_3 state_136 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L133] SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L134] SORT_3 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L135] SORT_3 state_139 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L136] SORT_3 state_140 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L137] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L138] SORT_3 state_142 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L142] input_2 = __VERIFIER_nondet_uchar() [L143] input_2 = input_2 & mask_SORT_1 [L144] input_4 = __VERIFIER_nondet_uchar() [L145] input_5 = __VERIFIER_nondet_uchar() [L146] input_6 = __VERIFIER_nondet_uchar() [L147] input_7 = __VERIFIER_nondet_uchar() [L148] input_8 = __VERIFIER_nondet_uchar() [L149] input_9 = __VERIFIER_nondet_uchar() [L150] input_9 = input_9 & mask_SORT_1 [L151] input_186 = __VERIFIER_nondet_uchar() [L152] input_249 = __VERIFIER_nondet_uchar() [L153] input_265 = __VERIFIER_nondet_uchar() [L154] input_266 = __VERIFIER_nondet_uchar() [L155] input_267 = __VERIFIER_nondet_uchar() [L156] input_268 = __VERIFIER_nondet_uchar() [L157] input_295 = __VERIFIER_nondet_uchar() [L158] input_296 = __VERIFIER_nondet_uchar() [L159] input_297 = __VERIFIER_nondet_uchar() [L160] input_306 = __VERIFIER_nondet_uchar() [L161] input_360 = __VERIFIER_nondet_uchar() [L162] input_372 = __VERIFIER_nondet_uchar() [L163] input_373 = __VERIFIER_nondet_uchar() [L164] input_374 = __VERIFIER_nondet_uchar() [L165] input_375 = __VERIFIER_nondet_uchar() [L166] input_384 = __VERIFIER_nondet_uchar() [L167] input_405 = __VERIFIER_nondet_uchar() [L168] input_406 = __VERIFIER_nondet_uchar() [L169] input_407 = __VERIFIER_nondet_uchar() [L170] input_416 = __VERIFIER_nondet_uchar() [L171] input_418 = __VERIFIER_nondet_uchar() [L172] input_464 = __VERIFIER_nondet_uchar() [L173] input_478 = __VERIFIER_nondet_uchar() [L174] input_479 = __VERIFIER_nondet_uchar() [L175] input_480 = __VERIFIER_nondet_uchar() [L176] input_481 = __VERIFIER_nondet_uchar() [L177] input_490 = __VERIFIER_nondet_uchar() [L178] input_492 = __VERIFIER_nondet_uchar() [L179] input_514 = __VERIFIER_nondet_uchar() [L180] input_515 = __VERIFIER_nondet_uchar() [L181] input_516 = __VERIFIER_nondet_uchar() [L182] input_525 = __VERIFIER_nondet_uchar() [L183] input_527 = __VERIFIER_nondet_uchar() [L184] input_529 = __VERIFIER_nondet_uchar() [L185] input_575 = __VERIFIER_nondet_uchar() [L186] input_586 = __VERIFIER_nondet_uchar() [L187] input_587 = __VERIFIER_nondet_uchar() [L188] input_588 = __VERIFIER_nondet_uchar() [L189] input_596 = __VERIFIER_nondet_uchar() [L190] input_598 = __VERIFIER_nondet_uchar() [L191] input_600 = __VERIFIER_nondet_uchar() [L192] input_620 = __VERIFIER_nondet_uchar() [L193] input_621 = __VERIFIER_nondet_uchar() [L194] input_629 = __VERIFIER_nondet_uchar() [L195] input_631 = __VERIFIER_nondet_uchar() [L196] input_633 = __VERIFIER_nondet_uchar() [L197] input_635 = __VERIFIER_nondet_uchar() [L200] SORT_1 var_12_arg_0 = state_10; [L201] SORT_1 var_12_arg_1 = var_11; [L202] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L203] SORT_3 var_15_arg_0 = state_13; [L204] SORT_3 var_15_arg_1 = var_14; [L205] SORT_1 var_15 = var_15_arg_0 >= var_15_arg_1; [L206] SORT_3 var_17_arg_0 = state_16; [L207] SORT_3 var_17_arg_1 = var_14; [L208] SORT_1 var_17 = var_17_arg_0 >= var_17_arg_1; [L209] SORT_1 var_18_arg_0 = var_15; [L210] SORT_1 var_18_arg_1 = var_17; [L211] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L212] SORT_3 var_20_arg_0 = state_19; [L213] SORT_3 var_20_arg_1 = var_14; [L214] SORT_1 var_20 = var_20_arg_0 >= var_20_arg_1; [L215] SORT_1 var_21_arg_0 = var_18; [L216] SORT_1 var_21_arg_1 = var_20; [L217] SORT_1 var_21 = var_21_arg_0 & var_21_arg_1; [L218] SORT_3 var_23_arg_0 = state_22; [L219] SORT_3 var_23_arg_1 = var_14; [L220] SORT_1 var_23 = var_23_arg_0 >= var_23_arg_1; [L221] SORT_1 var_24_arg_0 = var_21; [L222] SORT_1 var_24_arg_1 = var_23; [L223] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L224] SORT_1 var_25_arg_0 = var_24; [L225] SORT_1 var_25 = ~var_25_arg_0; [L226] SORT_26 var_28_arg_0 = state_27; [L227] SORT_1 var_28 = var_28_arg_0 >> 3; [L228] var_28 = var_28 & mask_SORT_1 [L229] SORT_1 var_30_arg_0 = var_28; [L230] SORT_1 var_30_arg_1 = var_29; [L231] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L232] SORT_1 var_31_arg_0 = var_25; [L233] SORT_1 var_31_arg_1 = var_30; [L234] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L235] SORT_3 var_33_arg_0 = state_32; [L236] SORT_3 var_33_arg_1 = var_14; [L237] SORT_1 var_33 = var_33_arg_0 >= var_33_arg_1; [L238] SORT_3 var_35_arg_0 = state_34; [L239] SORT_3 var_35_arg_1 = var_14; [L240] SORT_1 var_35 = var_35_arg_0 >= var_35_arg_1; [L241] SORT_1 var_36_arg_0 = var_33; [L242] SORT_1 var_36_arg_1 = var_35; [L243] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L244] SORT_3 var_38_arg_0 = state_37; [L245] SORT_3 var_38_arg_1 = var_14; [L246] SORT_1 var_38 = var_38_arg_0 >= var_38_arg_1; [L247] SORT_1 var_39_arg_0 = var_36; [L248] SORT_1 var_39_arg_1 = var_38; [L249] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L250] SORT_3 var_41_arg_0 = state_40; [L251] SORT_3 var_41_arg_1 = var_14; [L252] SORT_1 var_41 = var_41_arg_0 >= var_41_arg_1; [L253] SORT_1 var_42_arg_0 = var_39; [L254] SORT_1 var_42_arg_1 = var_41; [L255] SORT_1 var_42 = var_42_arg_0 & var_42_arg_1; [L256] SORT_1 var_43_arg_0 = var_42; [L257] SORT_1 var_43 = ~var_43_arg_0; [L258] SORT_26 var_44_arg_0 = state_27; [L259] SORT_1 var_44 = var_44_arg_0 >> 2; [L260] var_44 = var_44 & mask_SORT_1 [L261] SORT_1 var_45_arg_0 = var_44; [L262] SORT_1 var_45_arg_1 = var_29; [L263] SORT_1 var_45 = var_45_arg_0 >= var_45_arg_1; [L264] SORT_1 var_46_arg_0 = var_43; [L265] SORT_1 var_46_arg_1 = var_45; [L266] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L267] SORT_1 var_47_arg_0 = var_31; [L268] SORT_1 var_47_arg_1 = var_46; [L269] SORT_1 var_47 = var_47_arg_0 & var_47_arg_1; [L270] SORT_3 var_49_arg_0 = state_48; [L271] SORT_3 var_49_arg_1 = var_14; [L272] SORT_1 var_49 = var_49_arg_0 >= var_49_arg_1; [L273] SORT_3 var_51_arg_0 = state_50; [L274] SORT_3 var_51_arg_1 = var_14; [L275] SORT_1 var_51 = var_51_arg_0 >= var_51_arg_1; [L276] SORT_1 var_52_arg_0 = var_49; [L277] SORT_1 var_52_arg_1 = var_51; [L278] SORT_1 var_52 = var_52_arg_0 & var_52_arg_1; [L279] SORT_3 var_54_arg_0 = state_53; [L280] SORT_3 var_54_arg_1 = var_14; [L281] SORT_1 var_54 = var_54_arg_0 >= var_54_arg_1; [L282] SORT_1 var_55_arg_0 = var_52; [L283] SORT_1 var_55_arg_1 = var_54; [L284] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L285] SORT_3 var_57_arg_0 = state_56; [L286] SORT_3 var_57_arg_1 = var_14; [L287] SORT_1 var_57 = var_57_arg_0 >= var_57_arg_1; [L288] SORT_1 var_58_arg_0 = var_55; [L289] SORT_1 var_58_arg_1 = var_57; [L290] SORT_1 var_58 = var_58_arg_0 & var_58_arg_1; [L291] SORT_1 var_59_arg_0 = var_58; [L292] SORT_1 var_59 = ~var_59_arg_0; [L293] SORT_26 var_60_arg_0 = state_27; [L294] SORT_1 var_60 = var_60_arg_0 >> 1; [L295] var_60 = var_60 & mask_SORT_1 [L296] SORT_1 var_61_arg_0 = var_60; [L297] SORT_1 var_61_arg_1 = var_29; [L298] SORT_1 var_61 = var_61_arg_0 >= var_61_arg_1; [L299] SORT_1 var_62_arg_0 = var_59; [L300] SORT_1 var_62_arg_1 = var_61; [L301] SORT_1 var_62 = var_62_arg_0 | var_62_arg_1; [L302] SORT_1 var_63_arg_0 = var_47; [L303] SORT_1 var_63_arg_1 = var_62; [L304] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L305] SORT_3 var_65_arg_0 = state_64; [L306] SORT_3 var_65_arg_1 = var_14; [L307] SORT_1 var_65 = var_65_arg_0 >= var_65_arg_1; [L308] SORT_3 var_67_arg_0 = state_66; [L309] SORT_3 var_67_arg_1 = var_14; [L310] SORT_1 var_67 = var_67_arg_0 >= var_67_arg_1; [L311] SORT_1 var_68_arg_0 = var_65; [L312] SORT_1 var_68_arg_1 = var_67; [L313] SORT_1 var_68 = var_68_arg_0 & var_68_arg_1; [L314] SORT_3 var_70_arg_0 = state_69; [L315] SORT_3 var_70_arg_1 = var_14; [L316] SORT_1 var_70 = var_70_arg_0 >= var_70_arg_1; [L317] SORT_1 var_71_arg_0 = var_68; [L318] SORT_1 var_71_arg_1 = var_70; [L319] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L320] SORT_3 var_73_arg_0 = state_72; [L321] SORT_3 var_73_arg_1 = var_14; [L322] SORT_1 var_73 = var_73_arg_0 >= var_73_arg_1; [L323] SORT_1 var_74_arg_0 = var_71; [L324] SORT_1 var_74_arg_1 = var_73; [L325] SORT_1 var_74 = var_74_arg_0 & var_74_arg_1; [L326] SORT_1 var_75_arg_0 = var_74; [L327] SORT_1 var_75 = ~var_75_arg_0; [L328] SORT_26 var_76_arg_0 = state_27; [L329] SORT_1 var_76 = var_76_arg_0 >> 0; [L330] var_76 = var_76 & mask_SORT_1 [L331] SORT_1 var_77_arg_0 = var_76; [L332] SORT_1 var_77_arg_1 = var_29; [L333] SORT_1 var_77 = var_77_arg_0 >= var_77_arg_1; [L334] SORT_1 var_78_arg_0 = var_75; [L335] SORT_1 var_78_arg_1 = var_77; [L336] SORT_1 var_78 = var_78_arg_0 | var_78_arg_1; [L337] SORT_1 var_79_arg_0 = var_63; [L338] SORT_1 var_79_arg_1 = var_78; [L339] SORT_1 var_79 = var_79_arg_0 & var_79_arg_1; [L340] SORT_3 var_80_arg_0 = state_13; [L341] SORT_3 var_80_arg_1 = var_14; [L342] SORT_1 var_80 = var_80_arg_0 >= var_80_arg_1; [L343] SORT_3 var_81_arg_0 = state_16; [L344] SORT_3 var_81_arg_1 = var_14; [L345] SORT_1 var_81 = var_81_arg_0 >= var_81_arg_1; [L346] SORT_1 var_82_arg_0 = var_80; [L347] SORT_1 var_82_arg_1 = var_81; [L348] SORT_1 var_82 = var_82_arg_0 | var_82_arg_1; [L349] SORT_3 var_83_arg_0 = state_19; [L350] SORT_3 var_83_arg_1 = var_14; [L351] SORT_1 var_83 = var_83_arg_0 >= var_83_arg_1; [L352] SORT_1 var_84_arg_0 = var_82; [L353] SORT_1 var_84_arg_1 = var_83; [L354] SORT_1 var_84 = var_84_arg_0 | var_84_arg_1; [L355] SORT_3 var_85_arg_0 = state_22; [L356] SORT_3 var_85_arg_1 = var_14; [L357] SORT_1 var_85 = var_85_arg_0 >= var_85_arg_1; [L358] SORT_1 var_86_arg_0 = var_84; [L359] SORT_1 var_86_arg_1 = var_85; [L360] SORT_1 var_86 = var_86_arg_0 | var_86_arg_1; [L361] SORT_1 var_87_arg_0 = var_28; [L362] SORT_1 var_87_arg_1 = var_11; [L363] SORT_1 var_87 = var_87_arg_0 == var_87_arg_1; [L364] SORT_1 var_88_arg_0 = var_86; [L365] SORT_1 var_88_arg_1 = var_87; [L366] SORT_1 var_88 = var_88_arg_0 | var_88_arg_1; [L367] SORT_1 var_89_arg_0 = var_79; [L368] SORT_1 var_89_arg_1 = var_88; [L369] SORT_1 var_89 = var_89_arg_0 & var_89_arg_1; [L370] SORT_3 var_90_arg_0 = state_32; [L371] SORT_3 var_90_arg_1 = var_14; [L372] SORT_1 var_90 = var_90_arg_0 >= var_90_arg_1; [L373] SORT_3 var_91_arg_0 = state_34; [L374] SORT_3 var_91_arg_1 = var_14; [L375] SORT_1 var_91 = var_91_arg_0 >= var_91_arg_1; [L376] SORT_1 var_92_arg_0 = var_90; [L377] SORT_1 var_92_arg_1 = var_91; [L378] SORT_1 var_92 = var_92_arg_0 | var_92_arg_1; [L379] SORT_3 var_93_arg_0 = state_37; [L380] SORT_3 var_93_arg_1 = var_14; [L381] SORT_1 var_93 = var_93_arg_0 >= var_93_arg_1; [L382] SORT_1 var_94_arg_0 = var_92; [L383] SORT_1 var_94_arg_1 = var_93; [L384] SORT_1 var_94 = var_94_arg_0 | var_94_arg_1; [L385] SORT_3 var_95_arg_0 = state_40; [L386] SORT_3 var_95_arg_1 = var_14; [L387] SORT_1 var_95 = var_95_arg_0 >= var_95_arg_1; [L388] SORT_1 var_96_arg_0 = var_94; [L389] SORT_1 var_96_arg_1 = var_95; [L390] SORT_1 var_96 = var_96_arg_0 | var_96_arg_1; [L391] SORT_1 var_97_arg_0 = var_44; [L392] SORT_1 var_97_arg_1 = var_11; [L393] SORT_1 var_97 = var_97_arg_0 == var_97_arg_1; [L394] SORT_1 var_98_arg_0 = var_96; [L395] SORT_1 var_98_arg_1 = var_97; [L396] SORT_1 var_98 = var_98_arg_0 | var_98_arg_1; [L397] SORT_1 var_99_arg_0 = var_89; [L398] SORT_1 var_99_arg_1 = var_98; [L399] SORT_1 var_99 = var_99_arg_0 & var_99_arg_1; [L400] SORT_3 var_100_arg_0 = state_48; [L401] SORT_3 var_100_arg_1 = var_14; [L402] SORT_1 var_100 = var_100_arg_0 >= var_100_arg_1; [L403] SORT_3 var_101_arg_0 = state_50; [L404] SORT_3 var_101_arg_1 = var_14; [L405] SORT_1 var_101 = var_101_arg_0 >= var_101_arg_1; [L406] SORT_1 var_102_arg_0 = var_100; [L407] SORT_1 var_102_arg_1 = var_101; [L408] SORT_1 var_102 = var_102_arg_0 | var_102_arg_1; [L409] SORT_3 var_103_arg_0 = state_53; [L410] SORT_3 var_103_arg_1 = var_14; [L411] SORT_1 var_103 = var_103_arg_0 >= var_103_arg_1; [L412] SORT_1 var_104_arg_0 = var_102; [L413] SORT_1 var_104_arg_1 = var_103; [L414] SORT_1 var_104 = var_104_arg_0 | var_104_arg_1; [L415] SORT_3 var_105_arg_0 = state_56; [L416] SORT_3 var_105_arg_1 = var_14; [L417] SORT_1 var_105 = var_105_arg_0 >= var_105_arg_1; [L418] SORT_1 var_106_arg_0 = var_104; [L419] SORT_1 var_106_arg_1 = var_105; [L420] SORT_1 var_106 = var_106_arg_0 | var_106_arg_1; [L421] SORT_1 var_107_arg_0 = var_60; [L422] SORT_1 var_107_arg_1 = var_11; [L423] SORT_1 var_107 = var_107_arg_0 == var_107_arg_1; [L424] SORT_1 var_108_arg_0 = var_106; [L425] SORT_1 var_108_arg_1 = var_107; [L426] SORT_1 var_108 = var_108_arg_0 | var_108_arg_1; [L427] SORT_1 var_109_arg_0 = var_99; [L428] SORT_1 var_109_arg_1 = var_108; [L429] SORT_1 var_109 = var_109_arg_0 & var_109_arg_1; [L430] SORT_3 var_110_arg_0 = state_64; [L431] SORT_3 var_110_arg_1 = var_14; [L432] SORT_1 var_110 = var_110_arg_0 >= var_110_arg_1; [L433] SORT_3 var_111_arg_0 = state_66; [L434] SORT_3 var_111_arg_1 = var_14; [L435] SORT_1 var_111 = var_111_arg_0 >= var_111_arg_1; [L436] SORT_1 var_112_arg_0 = var_110; [L437] SORT_1 var_112_arg_1 = var_111; [L438] SORT_1 var_112 = var_112_arg_0 | var_112_arg_1; [L439] SORT_3 var_113_arg_0 = state_69; [L440] SORT_3 var_113_arg_1 = var_14; [L441] SORT_1 var_113 = var_113_arg_0 >= var_113_arg_1; [L442] SORT_1 var_114_arg_0 = var_112; [L443] SORT_1 var_114_arg_1 = var_113; [L444] SORT_1 var_114 = var_114_arg_0 | var_114_arg_1; [L445] SORT_3 var_115_arg_0 = state_72; [L446] SORT_3 var_115_arg_1 = var_14; [L447] SORT_1 var_115 = var_115_arg_0 >= var_115_arg_1; [L448] SORT_1 var_116_arg_0 = var_114; [L449] SORT_1 var_116_arg_1 = var_115; [L450] SORT_1 var_116 = var_116_arg_0 | var_116_arg_1; [L451] SORT_1 var_117_arg_0 = var_76; [L452] SORT_1 var_117_arg_1 = var_11; [L453] SORT_1 var_117 = var_117_arg_0 == var_117_arg_1; [L454] SORT_1 var_118_arg_0 = var_116; [L455] SORT_1 var_118_arg_1 = var_117; [L456] SORT_1 var_118 = var_118_arg_0 | var_118_arg_1; [L457] SORT_1 var_119_arg_0 = var_109; [L458] SORT_1 var_119_arg_1 = var_118; [L459] SORT_1 var_119 = var_119_arg_0 & var_119_arg_1; [L460] SORT_1 var_120_arg_0 = var_12; [L461] SORT_1 var_120_arg_1 = var_119; [L462] SORT_1 var_120 = var_120_arg_0 | var_120_arg_1; [L463] SORT_1 var_123_arg_0 = var_120; [L464] SORT_1 var_123 = ~var_123_arg_0; [L465] SORT_1 var_124_arg_0 = var_29; [L466] SORT_1 var_124_arg_1 = var_123; [L467] SORT_1 var_124 = var_124_arg_0 & var_124_arg_1; [L468] var_124 = var_124 & mask_SORT_1 [L469] SORT_1 bad_125_arg_0 = var_124; [L470] CALL __VERIFIER_assert(!(bad_125_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 proved your program to be incorrect! [2025-01-09 08:21:16,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE