./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.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 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:23,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:23,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:15:23,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:23,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:23,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:23,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:23,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:23,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:23,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:23,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:23,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:23,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:23,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:23,921 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:23,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:23,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:23,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:23,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:23,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:23,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:23,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:23,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:23,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:23,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:23,924 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 -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-02-08 00:15:24,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:24,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:24,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:24,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:24,145 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:24,147 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_vsaR_p08.c [2025-02-08 00:15:25,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e21736d76/ab12160cef1a47c1a94d495e57b8db38/FLAGdda525add [2025-02-08 00:15:25,711 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:25,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-02-08 00:15:25,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e21736d76/ab12160cef1a47c1a94d495e57b8db38/FLAGdda525add [2025-02-08 00:15:25,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e21736d76/ab12160cef1a47c1a94d495e57b8db38 [2025-02-08 00:15:26,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:26,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:26,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:26,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:26,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:26,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311e5e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26, skipping insertion in model container [2025-02-08 00:15:26,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:26,174 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_vsaR_p08.c[1259,1272] [2025-02-08 00:15:26,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:26,434 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:26,440 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_vsaR_p08.c[1259,1272] [2025-02-08 00:15:26,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:26,556 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:26,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26 WrapperNode [2025-02-08 00:15:26,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:26,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:26,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:26,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:26,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,835 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2601 [2025-02-08 00:15:26,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:26,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:26,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:26,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:26,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:26,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:26,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:27,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:27,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:27,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:27,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:27,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:27,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:27,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:27,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:27,095 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (1/1) ... [2025-02-08 00:15:27,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:27,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:27,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:27,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:15:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:27,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:27,439 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:27,441 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:29,500 INFO L? ?]: Removed 1626 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:29,500 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:29,599 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:29,599 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:29,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:29 BoogieIcfgContainer [2025-02-08 00:15:29,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:29,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:29,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:29,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:29,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:26" (1/3) ... [2025-02-08 00:15:29,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d24b9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:29, skipping insertion in model container [2025-02-08 00:15:29,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:26" (2/3) ... [2025-02-08 00:15:29,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d24b9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:29, skipping insertion in model container [2025-02-08 00:15:29,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:29" (3/3) ... [2025-02-08 00:15:29,654 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-02-08 00:15:29,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:29,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 681 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:29,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:29,726 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;@7c83762c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:29,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 681 states, 679 states have (on average 1.5007363770250368) internal successors, (1019), 680 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-08 00:15:29,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:29,737 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] [2025-02-08 00:15:29,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1411499908, now seen corresponding path program 1 times [2025-02-08 00:15:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:29,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754168421] [2025-02-08 00:15:29,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:29,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:29,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 00:15:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 00:15:29,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754168421] [2025-02-08 00:15:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754168421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203520443] [2025-02-08 00:15:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:30,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:30,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:30,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:30,774 INFO L87 Difference]: Start difference. First operand has 681 states, 679 states have (on average 1.5007363770250368) internal successors, (1019), 680 states have internal predecessors, (1019), 0 states have call successors, (0), 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 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:31,110 INFO L93 Difference]: Finished difference Result 1309 states and 1961 transitions. [2025-02-08 00:15:31,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:31,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-02-08 00:15:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:31,120 INFO L225 Difference]: With dead ends: 1309 [2025-02-08 00:15:31,120 INFO L226 Difference]: Without dead ends: 681 [2025-02-08 00:15:31,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:31,125 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:31,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2533 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-02-08 00:15:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2025-02-08 00:15:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.4970588235294118) internal successors, (1018), 680 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1018 transitions. [2025-02-08 00:15:31,174 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1018 transitions. Word has length 120 [2025-02-08 00:15:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1018 transitions. [2025-02-08 00:15:31,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1018 transitions. [2025-02-08 00:15:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-08 00:15:31,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:31,177 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] [2025-02-08 00:15:31,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:15:31,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:31,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash 811504103, now seen corresponding path program 1 times [2025-02-08 00:15:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747239966] [2025-02-08 00:15:31,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:31,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 00:15:31,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 00:15:31,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:31,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:31,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-02-08 00:15:31,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:31,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747239966] [2025-02-08 00:15:31,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747239966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:31,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849622598] [2025-02-08 00:15:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:31,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:31,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:31,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:31,605 INFO L87 Difference]: Start difference. First operand 681 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:32,050 INFO L93 Difference]: Finished difference Result 1311 states and 1960 transitions. [2025-02-08 00:15:32,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-02-08 00:15:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:32,053 INFO L225 Difference]: With dead ends: 1311 [2025-02-08 00:15:32,053 INFO L226 Difference]: Without dead ends: 683 [2025-02-08 00:15:32,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:32,055 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:32,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2530 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-08 00:15:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-02-08 00:15:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.4956011730205279) internal successors, (1020), 682 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1020 transitions. [2025-02-08 00:15:32,069 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1020 transitions. Word has length 121 [2025-02-08 00:15:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:32,069 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1020 transitions. [2025-02-08 00:15:32,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1020 transitions. [2025-02-08 00:15:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-08 00:15:32,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:32,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:32,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:15:32,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:32,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1318333407, now seen corresponding path program 1 times [2025-02-08 00:15:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017212968] [2025-02-08 00:15:32,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:32,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 00:15:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 00:15:32,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:32,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017212968] [2025-02-08 00:15:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017212968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:32,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:32,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582607941] [2025-02-08 00:15:32,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:32,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:32,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:32,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:32,842 INFO L87 Difference]: Start difference. First operand 683 states and 1020 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:33,360 INFO L93 Difference]: Finished difference Result 1453 states and 2171 transitions. [2025-02-08 00:15:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-02-08 00:15:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:33,364 INFO L225 Difference]: With dead ends: 1453 [2025-02-08 00:15:33,366 INFO L226 Difference]: Without dead ends: 823 [2025-02-08 00:15:33,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:33,368 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 137 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 4207 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:33,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 4207 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-02-08 00:15:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 820. [2025-02-08 00:15:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 1.4945054945054945) internal successors, (1224), 819 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1224 transitions. [2025-02-08 00:15:33,399 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1224 transitions. Word has length 122 [2025-02-08 00:15:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:33,400 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1224 transitions. [2025-02-08 00:15:33,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1224 transitions. [2025-02-08 00:15:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 00:15:33,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:33,404 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] [2025-02-08 00:15:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:15:33,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1963306341, now seen corresponding path program 1 times [2025-02-08 00:15:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246079849] [2025-02-08 00:15:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:33,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 00:15:33,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 00:15:33,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:33,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:33,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246079849] [2025-02-08 00:15:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246079849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159408919] [2025-02-08 00:15:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:33,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:33,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:33,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:33,716 INFO L87 Difference]: Start difference. First operand 820 states and 1224 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:34,040 INFO L93 Difference]: Finished difference Result 1605 states and 2396 transitions. [2025-02-08 00:15:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:34,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-02-08 00:15:34,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:34,043 INFO L225 Difference]: With dead ends: 1605 [2025-02-08 00:15:34,043 INFO L226 Difference]: Without dead ends: 838 [2025-02-08 00:15:34,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:34,047 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:34,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-02-08 00:15:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-02-08 00:15:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.4934289127837514) internal successors, (1250), 837 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1250 transitions. [2025-02-08 00:15:34,071 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1250 transitions. Word has length 123 [2025-02-08 00:15:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:34,071 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1250 transitions. [2025-02-08 00:15:34,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1250 transitions. [2025-02-08 00:15:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 00:15:34,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:34,073 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] [2025-02-08 00:15:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:15:34,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -192974068, now seen corresponding path program 1 times [2025-02-08 00:15:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698390953] [2025-02-08 00:15:34,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:34,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 00:15:34,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 00:15:34,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:34,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:34,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:34,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698390953] [2025-02-08 00:15:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698390953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:34,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:34,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617225161] [2025-02-08 00:15:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:34,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:15:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:34,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:15:34,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:15:34,629 INFO L87 Difference]: Start difference. First operand 838 states and 1250 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:35,198 INFO L93 Difference]: Finished difference Result 1633 states and 2436 transitions. [2025-02-08 00:15:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:15:35,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-02-08 00:15:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:35,201 INFO L225 Difference]: With dead ends: 1633 [2025-02-08 00:15:35,201 INFO L226 Difference]: Without dead ends: 848 [2025-02-08 00:15:35,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:15:35,202 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1326 mSDsluCounter, 4169 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:35,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 5005 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-02-08 00:15:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2025-02-08 00:15:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.493491124260355) internal successors, (1262), 845 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1262 transitions. [2025-02-08 00:15:35,219 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1262 transitions. Word has length 123 [2025-02-08 00:15:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:35,219 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1262 transitions. [2025-02-08 00:15:35,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1262 transitions. [2025-02-08 00:15:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-08 00:15:35,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:35,220 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] [2025-02-08 00:15:35,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:15:35,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:35,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2074340544, now seen corresponding path program 1 times [2025-02-08 00:15:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653207011] [2025-02-08 00:15:35,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:35,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 00:15:35,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 00:15:35,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:35,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:35,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653207011] [2025-02-08 00:15:35,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653207011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:35,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:35,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:15:35,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083171111] [2025-02-08 00:15:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:35,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:15:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:35,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:15:35,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:35,710 INFO L87 Difference]: Start difference. First operand 846 states and 1262 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:36,206 INFO L93 Difference]: Finished difference Result 1639 states and 2445 transitions. [2025-02-08 00:15:36,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:15:36,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-02-08 00:15:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:36,209 INFO L225 Difference]: With dead ends: 1639 [2025-02-08 00:15:36,209 INFO L226 Difference]: Without dead ends: 846 [2025-02-08 00:15:36,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:36,211 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 137 mSDsluCounter, 4192 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 5033 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:36,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 5033 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-02-08 00:15:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 845. [2025-02-08 00:15:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4928909952606635) internal successors, (1260), 844 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1260 transitions. [2025-02-08 00:15:36,226 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1260 transitions. Word has length 124 [2025-02-08 00:15:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:36,226 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1260 transitions. [2025-02-08 00:15:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1260 transitions. [2025-02-08 00:15:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-08 00:15:36,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:36,228 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] [2025-02-08 00:15:36,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:15:36,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:36,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1479116102, now seen corresponding path program 1 times [2025-02-08 00:15:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:36,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866997126] [2025-02-08 00:15:36,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:36,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-08 00:15:36,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-08 00:15:36,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:36,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-02-08 00:15:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:36,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866997126] [2025-02-08 00:15:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866997126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:36,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852675584] [2025-02-08 00:15:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:36,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:36,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:36,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:36,667 INFO L87 Difference]: Start difference. First operand 845 states and 1260 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:37,080 INFO L93 Difference]: Finished difference Result 1639 states and 2444 transitions. [2025-02-08 00:15:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:37,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-02-08 00:15:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:37,083 INFO L225 Difference]: With dead ends: 1639 [2025-02-08 00:15:37,083 INFO L226 Difference]: Without dead ends: 847 [2025-02-08 00:15:37,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:15:37,085 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 987 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:37,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 3327 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-02-08 00:15:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-02-08 00:15:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 1.491725768321513) internal successors, (1262), 846 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1262 transitions. [2025-02-08 00:15:37,100 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1262 transitions. Word has length 124 [2025-02-08 00:15:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:37,100 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1262 transitions. [2025-02-08 00:15:37,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1262 transitions. [2025-02-08 00:15:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-08 00:15:37,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:37,105 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] [2025-02-08 00:15:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:15:37,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:37,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 747859715, now seen corresponding path program 1 times [2025-02-08 00:15:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276040786] [2025-02-08 00:15:37,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:37,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 00:15:37,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 00:15:37,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:37,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276040786] [2025-02-08 00:15:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276040786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:37,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:37,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798013138] [2025-02-08 00:15:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:37,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:37,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:37,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:37,346 INFO L87 Difference]: Start difference. First operand 847 states and 1262 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:37,738 INFO L93 Difference]: Finished difference Result 1653 states and 2463 transitions. [2025-02-08 00:15:37,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:37,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-08 00:15:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:37,741 INFO L225 Difference]: With dead ends: 1653 [2025-02-08 00:15:37,741 INFO L226 Difference]: Without dead ends: 859 [2025-02-08 00:15:37,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:37,743 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:37,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4210 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-02-08 00:15:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2025-02-08 00:15:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.4895104895104896) internal successors, (1278), 858 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1278 transitions. [2025-02-08 00:15:37,757 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1278 transitions. Word has length 125 [2025-02-08 00:15:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:37,758 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1278 transitions. [2025-02-08 00:15:37,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1278 transitions. [2025-02-08 00:15:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-08 00:15:37,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:37,759 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] [2025-02-08 00:15:37,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:15:37,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:37,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2142954080, now seen corresponding path program 1 times [2025-02-08 00:15:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:37,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760264853] [2025-02-08 00:15:37,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:37,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 00:15:37,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 00:15:37,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:37,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760264853] [2025-02-08 00:15:38,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760264853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:38,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:15:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231410781] [2025-02-08 00:15:38,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:38,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:15:38,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:38,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:15:38,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:38,311 INFO L87 Difference]: Start difference. First operand 859 states and 1278 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:38,936 INFO L93 Difference]: Finished difference Result 1683 states and 2504 transitions. [2025-02-08 00:15:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:15:38,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-08 00:15:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:38,939 INFO L225 Difference]: With dead ends: 1683 [2025-02-08 00:15:38,939 INFO L226 Difference]: Without dead ends: 877 [2025-02-08 00:15:38,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:15:38,943 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 992 mSDsluCounter, 5022 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 5863 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:38,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 5863 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:15:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-02-08 00:15:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 873. [2025-02-08 00:15:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.488532110091743) internal successors, (1298), 872 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1298 transitions. [2025-02-08 00:15:38,956 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1298 transitions. Word has length 125 [2025-02-08 00:15:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:38,956 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1298 transitions. [2025-02-08 00:15:38,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1298 transitions. [2025-02-08 00:15:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-08 00:15:38,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:38,958 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] [2025-02-08 00:15:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:15:38,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash -11027609, now seen corresponding path program 1 times [2025-02-08 00:15:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:38,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131186510] [2025-02-08 00:15:38,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:38,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 00:15:39,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 00:15:39,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:39,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131186510] [2025-02-08 00:15:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131186510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:39,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:39,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033827139] [2025-02-08 00:15:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:39,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:39,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:39,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:39,158 INFO L87 Difference]: Start difference. First operand 873 states and 1298 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:39,578 INFO L93 Difference]: Finished difference Result 1729 states and 2571 transitions. [2025-02-08 00:15:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-02-08 00:15:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:39,581 INFO L225 Difference]: With dead ends: 1729 [2025-02-08 00:15:39,581 INFO L226 Difference]: Without dead ends: 909 [2025-02-08 00:15:39,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:39,582 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:39,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-02-08 00:15:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2025-02-08 00:15:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.486784140969163) internal successors, (1350), 908 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1350 transitions. [2025-02-08 00:15:39,596 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1350 transitions. Word has length 126 [2025-02-08 00:15:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:39,597 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1350 transitions. [2025-02-08 00:15:39,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1350 transitions. [2025-02-08 00:15:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-08 00:15:39,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:39,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] [2025-02-08 00:15:39,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:15:39,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:39,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1802225547, now seen corresponding path program 1 times [2025-02-08 00:15:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:39,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678390958] [2025-02-08 00:15:39,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:39,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 00:15:39,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 00:15:39,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:39,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:40,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:40,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678390958] [2025-02-08 00:15:40,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678390958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:40,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:40,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 00:15:40,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396044136] [2025-02-08 00:15:40,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:40,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:15:40,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:40,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:15:40,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:15:40,308 INFO L87 Difference]: Start difference. First operand 909 states and 1350 transitions. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:41,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:41,148 INFO L93 Difference]: Finished difference Result 1768 states and 2626 transitions. [2025-02-08 00:15:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:15:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-02-08 00:15:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:41,151 INFO L225 Difference]: With dead ends: 1768 [2025-02-08 00:15:41,151 INFO L226 Difference]: Without dead ends: 912 [2025-02-08 00:15:41,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-02-08 00:15:41,152 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 646 mSDsluCounter, 6167 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 6991 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:41,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 6991 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:15:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-02-08 00:15:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2025-02-08 00:15:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.4851811196487377) internal successors, (1353), 911 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1353 transitions. [2025-02-08 00:15:41,165 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1353 transitions. Word has length 126 [2025-02-08 00:15:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:41,165 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1353 transitions. [2025-02-08 00:15:41,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1353 transitions. [2025-02-08 00:15:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-08 00:15:41,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:41,167 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] [2025-02-08 00:15:41,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:15:41,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1355013060, now seen corresponding path program 1 times [2025-02-08 00:15:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:41,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975651278] [2025-02-08 00:15:41,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:41,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-08 00:15:41,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-08 00:15:41,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:41,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975651278] [2025-02-08 00:15:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975651278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:41,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:41,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785453765] [2025-02-08 00:15:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:41,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:41,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:41,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:41,359 INFO L87 Difference]: Start difference. First operand 912 states and 1353 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:41,676 INFO L93 Difference]: Finished difference Result 1783 states and 2645 transitions. [2025-02-08 00:15:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-08 00:15:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:41,679 INFO L225 Difference]: With dead ends: 1783 [2025-02-08 00:15:41,680 INFO L226 Difference]: Without dead ends: 924 [2025-02-08 00:15:41,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:41,681 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:41,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3370 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-02-08 00:15:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2025-02-08 00:15:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.4832069339111593) internal successors, (1369), 923 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1369 transitions. [2025-02-08 00:15:41,694 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1369 transitions. Word has length 127 [2025-02-08 00:15:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:41,695 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1369 transitions. [2025-02-08 00:15:41,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1369 transitions. [2025-02-08 00:15:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-08 00:15:41,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:41,696 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] [2025-02-08 00:15:41,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:15:41,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:41,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1853946166, now seen corresponding path program 1 times [2025-02-08 00:15:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322020684] [2025-02-08 00:15:41,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:41,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-08 00:15:41,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-08 00:15:41,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:41,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:42,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:42,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322020684] [2025-02-08 00:15:42,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322020684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:42,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:42,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:15:42,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959487303] [2025-02-08 00:15:42,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:42,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:15:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:42,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:15:42,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:42,100 INFO L87 Difference]: Start difference. First operand 924 states and 1369 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:42,894 INFO L93 Difference]: Finished difference Result 2171 states and 3210 transitions. [2025-02-08 00:15:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:15:42,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-08 00:15:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:42,899 INFO L225 Difference]: With dead ends: 2171 [2025-02-08 00:15:42,900 INFO L226 Difference]: Without dead ends: 1300 [2025-02-08 00:15:42,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:15:42,902 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 1999 mSDsluCounter, 5008 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 5847 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:42,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 5847 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:15:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-02-08 00:15:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 928. [2025-02-08 00:15:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.483279395900755) internal successors, (1375), 927 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1375 transitions. [2025-02-08 00:15:42,921 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1375 transitions. Word has length 127 [2025-02-08 00:15:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:42,921 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1375 transitions. [2025-02-08 00:15:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1375 transitions. [2025-02-08 00:15:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-08 00:15:42,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:42,922 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] [2025-02-08 00:15:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:15:42,922 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:42,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1098093591, now seen corresponding path program 1 times [2025-02-08 00:15:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288653998] [2025-02-08 00:15:42,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:42,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 00:15:43,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 00:15:43,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:43,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:43,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288653998] [2025-02-08 00:15:43,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288653998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:43,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:43,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:43,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236934364] [2025-02-08 00:15:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:43,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:43,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:43,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:43,306 INFO L87 Difference]: Start difference. First operand 928 states and 1375 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:44,017 INFO L93 Difference]: Finished difference Result 2177 states and 3220 transitions. [2025-02-08 00:15:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:15:44,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-08 00:15:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:44,021 INFO L225 Difference]: With dead ends: 2177 [2025-02-08 00:15:44,021 INFO L226 Difference]: Without dead ends: 1302 [2025-02-08 00:15:44,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:44,023 INFO L435 NwaCegarLoop]: 1197 mSDtfsCounter, 1468 mSDsluCounter, 3187 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 4384 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:44,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 4384 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:15:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-02-08 00:15:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 928. [2025-02-08 00:15:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.483279395900755) internal successors, (1375), 927 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1375 transitions. [2025-02-08 00:15:44,038 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1375 transitions. Word has length 128 [2025-02-08 00:15:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:44,039 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1375 transitions. [2025-02-08 00:15:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1375 transitions. [2025-02-08 00:15:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-08 00:15:44,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:44,041 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] [2025-02-08 00:15:44,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:15:44,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1857043389, now seen corresponding path program 1 times [2025-02-08 00:15:44,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:44,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578566245] [2025-02-08 00:15:44,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:44,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 00:15:44,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 00:15:44,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:44,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:44,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:44,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578566245] [2025-02-08 00:15:44,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578566245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:44,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:44,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:44,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033800546] [2025-02-08 00:15:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:44,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:44,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:44,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:44,277 INFO L87 Difference]: Start difference. First operand 928 states and 1375 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:44,665 INFO L93 Difference]: Finished difference Result 1839 states and 2725 transitions. [2025-02-08 00:15:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-08 00:15:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:44,668 INFO L225 Difference]: With dead ends: 1839 [2025-02-08 00:15:44,668 INFO L226 Difference]: Without dead ends: 964 [2025-02-08 00:15:44,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:44,671 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 3365 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:44,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4210 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-02-08 00:15:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2025-02-08 00:15:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.4818276220145379) internal successors, (1427), 963 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1427 transitions. [2025-02-08 00:15:44,688 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1427 transitions. Word has length 128 [2025-02-08 00:15:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:44,688 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1427 transitions. [2025-02-08 00:15:44,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1427 transitions. [2025-02-08 00:15:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 00:15:44,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:44,690 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] [2025-02-08 00:15:44,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:15:44,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:44,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -839843732, now seen corresponding path program 1 times [2025-02-08 00:15:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102452166] [2025-02-08 00:15:44,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:44,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:44,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 00:15:44,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 00:15:44,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:44,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:45,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102452166] [2025-02-08 00:15:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102452166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:15:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255985022] [2025-02-08 00:15:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:45,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:45,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:45,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:45,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:45,052 INFO L87 Difference]: Start difference. First operand 964 states and 1427 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:45,468 INFO L93 Difference]: Finished difference Result 2211 states and 3266 transitions. [2025-02-08 00:15:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:45,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-02-08 00:15:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:45,472 INFO L225 Difference]: With dead ends: 2211 [2025-02-08 00:15:45,472 INFO L226 Difference]: Without dead ends: 1300 [2025-02-08 00:15:45,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:45,473 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 454 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:45,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3266 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:15:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-02-08 00:15:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 966. [2025-02-08 00:15:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.4808290155440416) internal successors, (1429), 965 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1429 transitions. [2025-02-08 00:15:45,486 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1429 transitions. Word has length 129 [2025-02-08 00:15:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:45,486 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1429 transitions. [2025-02-08 00:15:45,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1429 transitions. [2025-02-08 00:15:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 00:15:45,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:45,487 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] [2025-02-08 00:15:45,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:15:45,487 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:45,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2135927573, now seen corresponding path program 1 times [2025-02-08 00:15:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486988259] [2025-02-08 00:15:45,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:45,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 00:15:45,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 00:15:45,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:45,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486988259] [2025-02-08 00:15:45,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486988259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:45,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:45,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285236588] [2025-02-08 00:15:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:45,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:45,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:45,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:45,657 INFO L87 Difference]: Start difference. First operand 966 states and 1429 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:45,963 INFO L93 Difference]: Finished difference Result 1889 states and 2795 transitions. [2025-02-08 00:15:45,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:45,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-02-08 00:15:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:45,965 INFO L225 Difference]: With dead ends: 1889 [2025-02-08 00:15:45,966 INFO L226 Difference]: Without dead ends: 978 [2025-02-08 00:15:45,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:45,967 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:45,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-02-08 00:15:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2025-02-08 00:15:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1445 transitions. [2025-02-08 00:15:45,979 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1445 transitions. Word has length 129 [2025-02-08 00:15:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:45,979 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1445 transitions. [2025-02-08 00:15:45,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1445 transitions. [2025-02-08 00:15:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-08 00:15:45,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:45,980 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] [2025-02-08 00:15:45,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:15:45,980 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:45,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1556308083, now seen corresponding path program 1 times [2025-02-08 00:15:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614505607] [2025-02-08 00:15:45,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:46,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-08 00:15:46,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-08 00:15:46,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:46,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:46,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614505607] [2025-02-08 00:15:46,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614505607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:46,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:46,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:15:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061559837] [2025-02-08 00:15:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:46,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:15:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:46,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:15:46,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:46,187 INFO L87 Difference]: Start difference. First operand 978 states and 1445 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:46,498 INFO L93 Difference]: Finished difference Result 1937 states and 2863 transitions. [2025-02-08 00:15:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-02-08 00:15:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:46,501 INFO L225 Difference]: With dead ends: 1937 [2025-02-08 00:15:46,501 INFO L226 Difference]: Without dead ends: 1014 [2025-02-08 00:15:46,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:15:46,502 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:46,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-02-08 00:15:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2025-02-08 00:15:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.4777887462981243) internal successors, (1497), 1013 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1497 transitions. [2025-02-08 00:15:46,515 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1497 transitions. Word has length 130 [2025-02-08 00:15:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:46,515 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1497 transitions. [2025-02-08 00:15:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1497 transitions. [2025-02-08 00:15:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-08 00:15:46,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:46,516 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] [2025-02-08 00:15:46,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:15:46,516 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:46,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:46,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1037280370, now seen corresponding path program 1 times [2025-02-08 00:15:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:46,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848413166] [2025-02-08 00:15:46,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:46,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 00:15:46,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 00:15:46,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:46,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:46,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:46,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848413166] [2025-02-08 00:15:46,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848413166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787681639] [2025-02-08 00:15:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:46,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:46,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:46,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:46,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:46,676 INFO L87 Difference]: Start difference. First operand 1014 states and 1497 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:46,974 INFO L93 Difference]: Finished difference Result 1985 states and 2931 transitions. [2025-02-08 00:15:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-02-08 00:15:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:46,977 INFO L225 Difference]: With dead ends: 1985 [2025-02-08 00:15:46,977 INFO L226 Difference]: Without dead ends: 1026 [2025-02-08 00:15:46,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:46,978 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 4 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:46,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-02-08 00:15:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2025-02-08 00:15:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.4760975609756097) internal successors, (1513), 1025 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1513 transitions. [2025-02-08 00:15:46,988 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1513 transitions. Word has length 131 [2025-02-08 00:15:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:46,988 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1513 transitions. [2025-02-08 00:15:46,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1513 transitions. [2025-02-08 00:15:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-08 00:15:46,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:46,989 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] [2025-02-08 00:15:46,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:15:46,989 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 624546185, now seen corresponding path program 1 times [2025-02-08 00:15:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507185306] [2025-02-08 00:15:46,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:47,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 00:15:47,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 00:15:47,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:47,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:47,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507185306] [2025-02-08 00:15:47,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507185306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:47,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:47,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:15:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131631191] [2025-02-08 00:15:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:47,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:15:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:47,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:15:47,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:47,216 INFO L87 Difference]: Start difference. First operand 1026 states and 1513 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:47,521 INFO L93 Difference]: Finished difference Result 2033 states and 2999 transitions. [2025-02-08 00:15:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:15:47,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-02-08 00:15:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:47,524 INFO L225 Difference]: With dead ends: 2033 [2025-02-08 00:15:47,524 INFO L226 Difference]: Without dead ends: 1062 [2025-02-08 00:15:47,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:47,525 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 16 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:47,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:15:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-02-08 00:15:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-02-08 00:15:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.47502356267672) internal successors, (1565), 1061 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1565 transitions. [2025-02-08 00:15:47,536 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1565 transitions. Word has length 132 [2025-02-08 00:15:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:47,536 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1565 transitions. [2025-02-08 00:15:47,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1565 transitions. [2025-02-08 00:15:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-08 00:15:47,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:47,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] [2025-02-08 00:15:47,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:15:47,538 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:47,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash 511348135, now seen corresponding path program 1 times [2025-02-08 00:15:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926185267] [2025-02-08 00:15:47,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:47,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-08 00:15:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-08 00:15:47,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:47,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:48,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926185267] [2025-02-08 00:15:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926185267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:15:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93159381] [2025-02-08 00:15:48,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:48,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:15:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:48,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:15:48,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:48,006 INFO L87 Difference]: Start difference. First operand 1062 states and 1565 transitions. Second operand has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:48,670 INFO L93 Difference]: Finished difference Result 2075 states and 3057 transitions. [2025-02-08 00:15:48,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:15:48,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-02-08 00:15:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:48,673 INFO L225 Difference]: With dead ends: 2075 [2025-02-08 00:15:48,673 INFO L226 Difference]: Without dead ends: 1068 [2025-02-08 00:15:48,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:15:48,674 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 1317 mSDsluCounter, 4997 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 5832 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:48,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 5832 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:15:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-02-08 00:15:48,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1066. [2025-02-08 00:15:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 1.4741784037558685) internal successors, (1570), 1065 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1570 transitions. [2025-02-08 00:15:48,684 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1570 transitions. Word has length 133 [2025-02-08 00:15:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:48,684 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1570 transitions. [2025-02-08 00:15:48,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.777777777777779) internal successors, (133), 8 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1570 transitions. [2025-02-08 00:15:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-08 00:15:48,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:48,685 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] [2025-02-08 00:15:48,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:15:48,685 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:48,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:48,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1861474939, now seen corresponding path program 1 times [2025-02-08 00:15:48,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:48,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435829261] [2025-02-08 00:15:48,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:48,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:48,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 00:15:48,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 00:15:48,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:48,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435829261] [2025-02-08 00:15:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435829261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:15:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761091831] [2025-02-08 00:15:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:49,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:15:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:49,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:15:49,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:15:49,918 INFO L87 Difference]: Start difference. First operand 1066 states and 1570 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:50,505 INFO L93 Difference]: Finished difference Result 2097 states and 3087 transitions. [2025-02-08 00:15:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:15:50,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-08 00:15:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:50,510 INFO L225 Difference]: With dead ends: 2097 [2025-02-08 00:15:50,510 INFO L226 Difference]: Without dead ends: 1086 [2025-02-08 00:15:50,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:15:50,514 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 998 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 5011 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:50,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 5011 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:15:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-02-08 00:15:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1078. [2025-02-08 00:15:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.4707520891364902) internal successors, (1584), 1077 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1584 transitions. [2025-02-08 00:15:50,532 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1584 transitions. Word has length 134 [2025-02-08 00:15:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:50,532 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1584 transitions. [2025-02-08 00:15:50,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1584 transitions. [2025-02-08 00:15:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-08 00:15:50,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:50,534 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] [2025-02-08 00:15:50,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:15:50,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:50,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1325828070, now seen corresponding path program 1 times [2025-02-08 00:15:50,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:50,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808208936] [2025-02-08 00:15:50,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:50,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:50,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 00:15:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 00:15:50,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:50,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:15:50,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 00:15:50,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 00:15:50,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:15:51,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:15:51,035 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:15:51,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:15:51,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:15:51,039 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:51,106 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:15:51,125 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:15:51,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:15:51 BoogieIcfgContainer [2025-02-08 00:15:51,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:15:51,128 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:15:51,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:15:51,128 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:15:51,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:29" (3/4) ... [2025-02-08 00:15:51,130 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:15:51,131 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:15:51,131 INFO L158 Benchmark]: Toolchain (without parser) took 25128.31ms. Allocated memory was 142.6MB in the beginning and 998.2MB in the end (delta: 855.6MB). Free memory was 102.8MB in the beginning and 797.9MB in the end (delta: -695.1MB). Peak memory consumption was 163.3MB. Max. memory is 16.1GB. [2025-02-08 00:15:51,131 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:51,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.98ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 53.1MB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 00:15:51,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 278.22ms. Allocated memory is still 142.6MB. Free memory was 53.1MB in the beginning and 52.8MB in the end (delta: 238.9kB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2025-02-08 00:15:51,132 INFO L158 Benchmark]: Boogie Preprocessor took 256.93ms. Allocated memory is still 142.6MB. Free memory was 52.8MB in the beginning and 47.5MB in the end (delta: 5.3MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2025-02-08 00:15:51,132 INFO L158 Benchmark]: IcfgBuilder took 2505.84ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 47.5MB in the beginning and 53.7MB in the end (delta: -6.1MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. [2025-02-08 00:15:51,132 INFO L158 Benchmark]: TraceAbstraction took 21526.40ms. Allocated memory was 310.4MB in the beginning and 998.2MB in the end (delta: 687.9MB). Free memory was 53.7MB in the beginning and 798.0MB in the end (delta: -744.3MB). Peak memory consumption was 300.1MB. Max. memory is 16.1GB. [2025-02-08 00:15:51,132 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 998.2MB. Free memory was 798.0MB in the beginning and 797.9MB in the end (delta: 68.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:15:51,133 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.36ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.98ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 53.1MB in the end (delta: 49.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 278.22ms. Allocated memory is still 142.6MB. Free memory was 53.1MB in the beginning and 52.8MB in the end (delta: 238.9kB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 256.93ms. Allocated memory is still 142.6MB. Free memory was 52.8MB in the beginning and 47.5MB in the end (delta: 5.3MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2505.84ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 47.5MB in the beginning and 53.7MB in the end (delta: -6.1MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21526.40ms. Allocated memory was 310.4MB in the beginning and 998.2MB in the end (delta: 687.9MB). Free memory was 53.7MB in the beginning and 798.0MB in the end (delta: -744.3MB). Peak memory consumption was 300.1MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 998.2MB. Free memory was 798.0MB in the beginning and 797.9MB in the end (delta: 68.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 bitwiseOr at line 353, overapproximation of bitwiseAnd at line 358. 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 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_24 mask_SORT_24 = (SORT_24)-1 >> (sizeof(SORT_24) * 8 - 2); [L39] const SORT_24 msb_SORT_24 = (SORT_24)1 << (2 - 1); [L41] const SORT_156 mask_SORT_156 = (SORT_156)-1 >> (sizeof(SORT_156) * 8 - 4); [L42] const SORT_156 msb_SORT_156 = (SORT_156)1 << (4 - 1); [L44] const SORT_204 mask_SORT_204 = (SORT_204)-1 >> (sizeof(SORT_204) * 8 - 32); [L45] const SORT_204 msb_SORT_204 = (SORT_204)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 4; [L50] const SORT_10 var_18 = 0; [L51] const SORT_1 var_22 = 1; [L52] const SORT_24 var_26 = 0; [L53] const SORT_24 var_29 = 3; [L54] const SORT_3 var_34 = 0; [L55] const SORT_1 var_45 = 0; [L56] const SORT_10 var_118 = 2; [L57] const SORT_10 var_122 = 1; [L58] const SORT_10 var_128 = 5; [L59] const SORT_10 var_172 = 7; [L60] const SORT_10 var_177 = 6; [L61] const SORT_204 var_206 = 0; [L62] const SORT_3 var_221 = 2; [L63] const SORT_3 var_243 = 31; [L65] SORT_1 input_2; [L66] SORT_3 input_4; [L67] SORT_5 input_6; [L68] SORT_3 input_232; [L69] SORT_3 input_233; [L70] SORT_3 input_234; [L71] SORT_3 input_242; [L72] SORT_3 input_252; [L73] SORT_3 input_253; [L74] SORT_3 input_254; [L75] SORT_3 input_257; [L76] SORT_3 input_276; [L77] SORT_3 input_277; [L78] SORT_3 input_278; [L79] SORT_3 input_281; [L80] SORT_3 input_283; [L81] SORT_24 input_297; [L82] SORT_24 input_298; [L83] SORT_24 input_299; [L85] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L85] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L86] SORT_10 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L87] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L88] SORT_3 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L89] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L90] SORT_1 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L91] SORT_3 state_104 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L92] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L93] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L94] SORT_3 state_110 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L95] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L96] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_7=0] [L97] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L99] SORT_5 init_9_arg_1 = var_7; [L100] state_8 = init_9_arg_1 [L101] SORT_10 init_20_arg_1 = var_18; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_36_arg_1 = var_34; [L104] state_35 = init_36_arg_1 [L105] SORT_3 init_39_arg_1 = var_34; [L106] state_38 = init_39_arg_1 [L107] SORT_3 init_43_arg_1 = var_34; [L108] state_42 = init_43_arg_1 [L109] SORT_1 init_103_arg_1 = var_45; [L110] state_102 = init_103_arg_1 [L111] SORT_3 init_105_arg_1 = var_34; [L112] state_104 = init_105_arg_1 [L113] SORT_3 init_107_arg_1 = var_34; [L114] state_106 = init_107_arg_1 [L115] SORT_3 init_109_arg_1 = var_34; [L116] state_108 = init_109_arg_1 [L117] SORT_3 init_111_arg_1 = var_34; [L118] state_110 = init_111_arg_1 [L119] SORT_3 init_113_arg_1 = var_34; [L120] state_112 = init_113_arg_1 [L121] SORT_3 init_115_arg_1 = var_34; [L122] state_114 = init_115_arg_1 [L123] SORT_3 init_117_arg_1 = var_34; [L124] state_116 = init_117_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L127] input_2 = __VERIFIER_nondet_uchar() [L128] input_4 = __VERIFIER_nondet_uchar() [L129] input_6 = __VERIFIER_nondet_ushort() [L130] input_232 = __VERIFIER_nondet_uchar() [L131] input_233 = __VERIFIER_nondet_uchar() [L132] input_234 = __VERIFIER_nondet_uchar() [L133] input_242 = __VERIFIER_nondet_uchar() [L134] input_252 = __VERIFIER_nondet_uchar() [L135] input_253 = __VERIFIER_nondet_uchar() [L136] input_254 = __VERIFIER_nondet_uchar() [L137] input_257 = __VERIFIER_nondet_uchar() [L138] input_276 = __VERIFIER_nondet_uchar() [L139] input_277 = __VERIFIER_nondet_uchar() [L140] input_278 = __VERIFIER_nondet_uchar() [L141] input_281 = __VERIFIER_nondet_uchar() [L142] input_283 = __VERIFIER_nondet_uchar() [L143] input_297 = __VERIFIER_nondet_uchar() [L144] input_298 = __VERIFIER_nondet_uchar() [L145] input_299 = __VERIFIER_nondet_uchar() [L148] SORT_5 var_11_arg_0 = state_8; [L149] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L150] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_122=1, var_128=5, var_12=3, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L150] var_11 = var_11 & mask_SORT_10 [L151] SORT_10 var_13_arg_0 = var_11; [L152] SORT_10 var_13_arg_1 = var_12; [L153] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L154] SORT_5 var_14_arg_0 = state_8; [L155] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L156] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L156] var_14 = var_14 & mask_SORT_10 [L157] SORT_10 var_16_arg_0 = var_14; [L158] SORT_10 var_16_arg_1 = var_15; [L159] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L160] SORT_1 var_17_arg_0 = var_13; [L161] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17_arg_0=0, var_17_arg_1=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L162] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L162] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L163] SORT_10 var_21_arg_0 = state_19; [L164] SORT_1 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_21=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L165] EXPR var_21 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L165] var_21 = var_21 & mask_SORT_1 [L166] SORT_1 var_23_arg_0 = var_21; [L167] SORT_1 var_23_arg_1 = var_22; [L168] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L169] SORT_10 var_25_arg_0 = state_19; [L170] SORT_24 var_25 = var_25_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_23=0, var_243=31, var_25=0, var_26=0, var_29=3, var_34=0, var_45=0] [L171] EXPR var_25 & mask_SORT_24 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_23=0, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L171] var_25 = var_25 & mask_SORT_24 [L172] SORT_24 var_27_arg_0 = var_25; [L173] SORT_24 var_27_arg_1 = var_26; [L174] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L175] SORT_1 var_28_arg_0 = var_23; [L176] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_25=0, var_26=0, var_28_arg_0=0, var_28_arg_1=1, var_29=3, var_34=0, var_45=0] [L177] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_25=0, var_26=0, var_29=3, var_34=0, var_45=0] [L177] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L178] SORT_24 var_30_arg_0 = var_25; [L179] SORT_24 var_30_arg_1 = var_29; [L180] SORT_1 var_30 = var_30_arg_0 == var_30_arg_1; [L181] SORT_1 var_31_arg_0 = var_28; [L182] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_31_arg_0=1, var_31_arg_1=0, var_34=0, var_45=0] [L183] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_17=0, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L183] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L184] SORT_1 var_32_arg_0 = var_17; [L185] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_32_arg_0=0, var_32_arg_1=1, var_34=0, var_45=0] [L186] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L186] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L187] SORT_1 var_33_arg_0 = var_32; [L188] SORT_1 var_33 = ~var_33_arg_0; [L189] SORT_3 var_37_arg_0 = state_35; [L190] SORT_1 var_37 = var_37_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_45=0] [L191] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L191] var_37 = var_37 & mask_SORT_1 [L192] SORT_3 var_40_arg_0 = state_38; [L193] SORT_1 var_40 = var_40_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_45=0] [L194] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_45=0] [L194] var_40 = var_40 & mask_SORT_1 [L195] SORT_1 var_41_arg_0 = var_37; [L196] SORT_1 var_41_arg_1 = var_40; [L197] SORT_1 var_41 = var_41_arg_0 != var_41_arg_1; [L198] SORT_3 var_44_arg_0 = state_42; [L199] SORT_1 var_44 = var_44_arg_0 >> 4; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_41=0, var_44=0, var_45=0] [L200] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_41=0, var_45=0] [L200] var_44 = var_44 & mask_SORT_1 [L201] SORT_1 var_46_arg_0 = var_44; [L202] SORT_1 var_46_arg_1 = var_45; [L203] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L204] SORT_1 var_47_arg_0 = var_41; [L205] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_44=0, var_45=0, var_47_arg_0=0, var_47_arg_1=1] [L206] EXPR var_47_arg_0 | var_47_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_37=0, var_40=0, var_44=0, var_45=0] [L206] SORT_1 var_47 = var_47_arg_0 | var_47_arg_1; [L207] SORT_1 var_48_arg_0 = var_44; [L208] SORT_1 var_48_arg_1 = var_45; [L209] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L210] SORT_1 var_49_arg_0 = var_37; [L211] SORT_1 var_49_arg_1 = var_40; [L212] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L213] SORT_1 var_50_arg_0 = var_48; [L214] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_47=1, var_50_arg_0=0, var_50_arg_1=1] [L215] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_47=1] [L215] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L216] SORT_1 var_51_arg_0 = var_47; [L217] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51_arg_0=1, var_51_arg_1=1] [L218] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L218] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L219] SORT_3 var_52_arg_0 = state_35; [L220] SORT_1 var_52 = var_52_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0] [L221] EXPR var_52 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1] [L221] var_52 = var_52 & mask_SORT_1 [L222] SORT_3 var_53_arg_0 = state_38; [L223] SORT_1 var_53 = var_53_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0] [L224] EXPR var_53 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0] [L224] var_53 = var_53 & mask_SORT_1 [L225] SORT_1 var_54_arg_0 = var_52; [L226] SORT_1 var_54_arg_1 = var_53; [L227] SORT_1 var_54 = var_54_arg_0 != var_54_arg_1; [L228] SORT_3 var_55_arg_0 = state_42; [L229] SORT_1 var_55 = var_55_arg_0 >> 3; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_54=0, var_55=0] [L230] EXPR var_55 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_54=0] [L230] var_55 = var_55 & mask_SORT_1 [L231] SORT_1 var_56_arg_0 = var_55; [L232] SORT_1 var_56_arg_1 = var_45; [L233] SORT_1 var_56 = var_56_arg_0 == var_56_arg_1; [L234] SORT_1 var_57_arg_0 = var_54; [L235] SORT_1 var_57_arg_1 = var_56; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_55=0, var_57_arg_0=0, var_57_arg_1=1] [L236] EXPR var_57_arg_0 | var_57_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_51=1, var_52=0, var_53=0, var_55=0] [L236] SORT_1 var_57 = var_57_arg_0 | var_57_arg_1; [L237] SORT_1 var_58_arg_0 = var_51; [L238] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_52=0, var_53=0, var_55=0, var_58_arg_0=1, var_58_arg_1=1] [L239] EXPR var_58_arg_0 & var_58_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_52=0, var_53=0, var_55=0] [L239] SORT_1 var_58 = var_58_arg_0 & var_58_arg_1; [L240] SORT_1 var_59_arg_0 = var_55; [L241] SORT_1 var_59_arg_1 = var_45; [L242] SORT_1 var_59 = var_59_arg_0 != var_59_arg_1; [L243] SORT_1 var_60_arg_0 = var_52; [L244] SORT_1 var_60_arg_1 = var_53; [L245] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L246] SORT_1 var_61_arg_0 = var_59; [L247] SORT_1 var_61_arg_1 = var_60; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_58=1, var_61_arg_0=0, var_61_arg_1=1] [L248] EXPR var_61_arg_0 | var_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_58=1] [L248] SORT_1 var_61 = var_61_arg_0 | var_61_arg_1; [L249] SORT_1 var_62_arg_0 = var_58; [L250] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62_arg_0=1, var_62_arg_1=1] [L251] EXPR var_62_arg_0 & var_62_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L251] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L252] SORT_3 var_63_arg_0 = state_35; [L253] SORT_1 var_63 = var_63_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0] [L254] EXPR var_63 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1] [L254] var_63 = var_63 & mask_SORT_1 [L255] SORT_3 var_64_arg_0 = state_38; [L256] SORT_1 var_64 = var_64_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0] [L257] EXPR var_64 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0] [L257] var_64 = var_64 & mask_SORT_1 [L258] SORT_1 var_65_arg_0 = var_63; [L259] SORT_1 var_65_arg_1 = var_64; [L260] SORT_1 var_65 = var_65_arg_0 != var_65_arg_1; [L261] SORT_3 var_66_arg_0 = state_42; [L262] SORT_1 var_66 = var_66_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_65=0, var_66=0] [L263] EXPR var_66 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_65=0] [L263] var_66 = var_66 & mask_SORT_1 [L264] SORT_1 var_67_arg_0 = var_66; [L265] SORT_1 var_67_arg_1 = var_45; [L266] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L267] SORT_1 var_68_arg_0 = var_65; [L268] SORT_1 var_68_arg_1 = var_67; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_66=0, var_68_arg_0=0, var_68_arg_1=1] [L269] EXPR var_68_arg_0 | var_68_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_62=1, var_63=0, var_64=0, var_66=0] [L269] SORT_1 var_68 = var_68_arg_0 | var_68_arg_1; [L270] SORT_1 var_69_arg_0 = var_62; [L271] SORT_1 var_69_arg_1 = var_68; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_63=0, var_64=0, var_66=0, var_69_arg_0=1, var_69_arg_1=1] [L272] EXPR var_69_arg_0 & var_69_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_63=0, var_64=0, var_66=0] [L272] SORT_1 var_69 = var_69_arg_0 & var_69_arg_1; [L273] SORT_1 var_70_arg_0 = var_66; [L274] SORT_1 var_70_arg_1 = var_45; [L275] SORT_1 var_70 = var_70_arg_0 != var_70_arg_1; [L276] SORT_1 var_71_arg_0 = var_63; [L277] SORT_1 var_71_arg_1 = var_64; [L278] SORT_1 var_71 = var_71_arg_0 == var_71_arg_1; [L279] SORT_1 var_72_arg_0 = var_70; [L280] SORT_1 var_72_arg_1 = var_71; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_69=1, var_72_arg_0=0, var_72_arg_1=1] [L281] EXPR var_72_arg_0 | var_72_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_69=1] [L281] SORT_1 var_72 = var_72_arg_0 | var_72_arg_1; [L282] SORT_1 var_73_arg_0 = var_69; [L283] SORT_1 var_73_arg_1 = var_72; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73_arg_0=1, var_73_arg_1=1] [L284] EXPR var_73_arg_0 & var_73_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L284] SORT_1 var_73 = var_73_arg_0 & var_73_arg_1; [L285] SORT_3 var_74_arg_0 = state_35; [L286] SORT_1 var_74 = var_74_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0] [L287] EXPR var_74 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1] [L287] var_74 = var_74 & mask_SORT_1 [L288] SORT_3 var_75_arg_0 = state_38; [L289] SORT_1 var_75 = var_75_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0] [L290] EXPR var_75 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0] [L290] var_75 = var_75 & mask_SORT_1 [L291] SORT_1 var_76_arg_0 = var_74; [L292] SORT_1 var_76_arg_1 = var_75; [L293] SORT_1 var_76 = var_76_arg_0 != var_76_arg_1; [L294] SORT_3 var_77_arg_0 = state_42; [L295] SORT_1 var_77 = var_77_arg_0 >> 1; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_76=0, var_77=0] [L296] EXPR var_77 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_76=0] [L296] var_77 = var_77 & mask_SORT_1 [L297] SORT_1 var_78_arg_0 = var_77; [L298] SORT_1 var_78_arg_1 = var_45; [L299] SORT_1 var_78 = var_78_arg_0 == var_78_arg_1; [L300] SORT_1 var_79_arg_0 = var_76; [L301] SORT_1 var_79_arg_1 = var_78; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_77=0, var_79_arg_0=0, var_79_arg_1=1] [L302] EXPR var_79_arg_0 | var_79_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_73=1, var_74=0, var_75=0, var_77=0] [L302] SORT_1 var_79 = var_79_arg_0 | var_79_arg_1; [L303] SORT_1 var_80_arg_0 = var_73; [L304] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_74=0, var_75=0, var_77=0, var_80_arg_0=1, var_80_arg_1=1] [L305] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_74=0, var_75=0, var_77=0] [L305] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L306] SORT_1 var_81_arg_0 = var_77; [L307] SORT_1 var_81_arg_1 = var_45; [L308] SORT_1 var_81 = var_81_arg_0 != var_81_arg_1; [L309] SORT_1 var_82_arg_0 = var_74; [L310] SORT_1 var_82_arg_1 = var_75; [L311] SORT_1 var_82 = var_82_arg_0 == var_82_arg_1; [L312] SORT_1 var_83_arg_0 = var_81; [L313] SORT_1 var_83_arg_1 = var_82; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_80=1, var_83_arg_0=0, var_83_arg_1=1] [L314] EXPR var_83_arg_0 | var_83_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_80=1] [L314] SORT_1 var_83 = var_83_arg_0 | var_83_arg_1; [L315] SORT_1 var_84_arg_0 = var_80; [L316] SORT_1 var_84_arg_1 = var_83; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84_arg_0=1, var_84_arg_1=1] [L317] EXPR var_84_arg_0 & var_84_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L317] SORT_1 var_84 = var_84_arg_0 & var_84_arg_1; [L318] SORT_3 var_85_arg_0 = state_35; [L319] SORT_1 var_85 = var_85_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0] [L320] EXPR var_85 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1] [L320] var_85 = var_85 & mask_SORT_1 [L321] SORT_3 var_86_arg_0 = state_38; [L322] SORT_1 var_86 = var_86_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0] [L323] EXPR var_86 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0] [L323] var_86 = var_86 & mask_SORT_1 [L324] SORT_1 var_87_arg_0 = var_85; [L325] SORT_1 var_87_arg_1 = var_86; [L326] SORT_1 var_87 = var_87_arg_0 != var_87_arg_1; [L327] SORT_3 var_88_arg_0 = state_42; [L328] SORT_1 var_88 = var_88_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_87=0, var_88=0] [L329] EXPR var_88 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_87=0] [L329] var_88 = var_88 & mask_SORT_1 [L330] SORT_1 var_89_arg_0 = var_88; [L331] SORT_1 var_89_arg_1 = var_45; [L332] SORT_1 var_89 = var_89_arg_0 == var_89_arg_1; [L333] SORT_1 var_90_arg_0 = var_87; [L334] SORT_1 var_90_arg_1 = var_89; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_88=0, var_90_arg_0=0, var_90_arg_1=1] [L335] EXPR var_90_arg_0 | var_90_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_84=1, var_85=0, var_86=0, var_88=0] [L335] SORT_1 var_90 = var_90_arg_0 | var_90_arg_1; [L336] SORT_1 var_91_arg_0 = var_84; [L337] SORT_1 var_91_arg_1 = var_90; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_85=0, var_86=0, var_88=0, var_91_arg_0=1, var_91_arg_1=1] [L338] EXPR var_91_arg_0 & var_91_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_85=0, var_86=0, var_88=0] [L338] SORT_1 var_91 = var_91_arg_0 & var_91_arg_1; [L339] SORT_1 var_92_arg_0 = var_88; [L340] SORT_1 var_92_arg_1 = var_45; [L341] SORT_1 var_92 = var_92_arg_0 != var_92_arg_1; [L342] SORT_1 var_93_arg_0 = var_85; [L343] SORT_1 var_93_arg_1 = var_86; [L344] SORT_1 var_93 = var_93_arg_0 == var_93_arg_1; [L345] SORT_1 var_94_arg_0 = var_92; [L346] SORT_1 var_94_arg_1 = var_93; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_91=1, var_94_arg_0=0, var_94_arg_1=1] [L347] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_91=1] [L347] SORT_1 var_94 = var_94_arg_0 | var_94_arg_1; [L348] SORT_1 var_95_arg_0 = var_91; [L349] SORT_1 var_95_arg_1 = var_94; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0, var_95_arg_0=1, var_95_arg_1=1] [L350] EXPR var_95_arg_0 & var_95_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_33=-1, var_34=0, var_45=0] [L350] SORT_1 var_95 = var_95_arg_0 & var_95_arg_1; [L351] SORT_1 var_96_arg_0 = var_33; [L352] SORT_1 var_96_arg_1 = var_95; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0, var_96_arg_0=-1, var_96_arg_1=1] [L353] EXPR var_96_arg_0 | var_96_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L353] SORT_1 var_96 = var_96_arg_0 | var_96_arg_1; [L354] SORT_1 var_99_arg_0 = var_96; [L355] SORT_1 var_99 = ~var_99_arg_0; [L356] SORT_1 var_100_arg_0 = var_22; [L357] SORT_1 var_100_arg_1 = var_99; VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_100_arg_0=1, var_100_arg_1=-1, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L358] EXPR var_100_arg_0 & var_100_arg_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L358] SORT_1 var_100 = var_100_arg_0 & var_100_arg_1; [L359] EXPR var_100 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_156=15, mask_SORT_1=1, mask_SORT_24=3, mask_SORT_3=31, state_102=0, state_104=0, state_106=0, state_108=0, state_110=0, state_112=0, state_114=0, state_116=0, state_19=0, state_35=0, state_38=0, state_42=0, state_8=0, var_118=2, var_11=0, var_122=1, var_128=5, var_12=3, var_13=0, var_14=0, var_15=4, var_172=7, var_177=6, var_18=0, var_206=0, var_221=2, var_22=1, var_243=31, var_26=0, var_29=3, var_34=0, var_45=0] [L359] var_100 = var_100 & mask_SORT_1 [L360] SORT_1 bad_101_arg_0 = var_100; [L361] CALL __VERIFIER_assert(!(bad_101_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 681 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10557 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10557 mSDsluCounter, 91839 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72976 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19798 IncrementalHoareTripleChecker+Invalid, 19819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 18863 mSDtfsCounter, 19798 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1078occurred in iteration=22, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1100 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2922 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 7441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:15:51,168 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 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_vsaR_p08.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 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:15:53,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:15:53,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:15:53,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:15:53,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:15:53,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:15:53,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:15:53,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:15:53,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:15:53,463 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:15:53,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:15:53,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:15:53,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:15:53,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:15:53,464 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:15:53,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:15:53,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:15:53,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:15:53,464 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:15:53,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:15:53,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:15:53,465 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:15:53,465 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:15:53,465 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:15:53,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:15:53,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:15:53,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:15:53,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:15:53,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:15:53,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:15:53,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:15:53,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:53,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:15:53,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:15:53,467 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:15:53,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:15:53,467 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:15:53,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:15:53,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:15:53,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:15:53,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:15:53,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:15:53,468 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 -> 158825441bba3feb949ddeebc9960176b40b93a77b9957f5b3b8b9ba5682b39e [2025-02-08 00:15:53,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:15:53,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:15:53,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:15:53,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:15:53,752 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:15:53,753 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_vsaR_p08.c [2025-02-08 00:15:54,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7963999/3c9b1e64de06464891ccfdfdf34ab56d/FLAG3742b3e1c [2025-02-08 00:15:55,263 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:15:55,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-02-08 00:15:55,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7963999/3c9b1e64de06464891ccfdfdf34ab56d/FLAG3742b3e1c [2025-02-08 00:15:55,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b7963999/3c9b1e64de06464891ccfdfdf34ab56d [2025-02-08 00:15:55,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:15:55,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:15:55,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:55,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:15:55,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:15:55,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244f4cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55, skipping insertion in model container [2025-02-08 00:15:55,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:15:55,490 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_vsaR_p08.c[1259,1272] [2025-02-08 00:15:55,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:55,696 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:15:55,703 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_vsaR_p08.c[1259,1272] [2025-02-08 00:15:55,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:15:55,800 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:15:55,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55 WrapperNode [2025-02-08 00:15:55,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:15:55,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:55,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:15:55,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:15:55,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,880 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1255 [2025-02-08 00:15:55,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:15:55,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:15:55,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:15:55,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:15:55,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:15:55,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,979 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:15:55,993 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:15:55,993 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:15:55,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:15:55,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (1/1) ... [2025-02-08 00:15:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:15:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:56,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:15:56,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:15:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:15:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:15:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:15:56,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:15:56,294 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:15:56,296 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:15:57,441 INFO L? ?]: Removed 234 outVars from TransFormulas that were not future-live. [2025-02-08 00:15:57,441 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:15:57,448 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:15:57,448 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:15:57,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:57 BoogieIcfgContainer [2025-02-08 00:15:57,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:15:57,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:15:57,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:15:57,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:15:57,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:15:55" (1/3) ... [2025-02-08 00:15:57,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4214160e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:57, skipping insertion in model container [2025-02-08 00:15:57,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:15:55" (2/3) ... [2025-02-08 00:15:57,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4214160e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:15:57, skipping insertion in model container [2025-02-08 00:15:57,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:15:57" (3/3) ... [2025-02-08 00:15:57,456 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c [2025-02-08 00:15:57,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:15:57,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p08.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:15:57,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:15:57,505 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;@19ead5bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:15:57,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:15:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:15:57,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:57,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:15:57,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:57,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:15:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294153629] [2025-02-08 00:15:57,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:57,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:57,527 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-02-08 00:15:57,528 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-02-08 00:15:57,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:15:57,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:15:57,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:57,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:57,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-02-08 00:15:57,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:15:58,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:15:58,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:15:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294153629] [2025-02-08 00:15:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294153629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:15:58,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:15:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:15:58,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519826112] [2025-02-08 00:15:58,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:15:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:15:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:15:58,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:15:58,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:15:58,962 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:59,045 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:15:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:15:59,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-08 00:15:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:59,051 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:15:59,051 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:15:59,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:15:59,054 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:59,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:15:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:15:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:15:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:15:59,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:15:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:59,072 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:15:59,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:15:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:15:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:15:59,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:59,072 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:15:59,080 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-02-08 00:15:59,273 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-02-08 00:15:59,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:59,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:15:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:15:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325674514] [2025-02-08 00:15:59,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:59,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:59,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:59,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:15:59,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:15:59,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:15:59,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:59,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:59,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-02-08 00:15:59,719 INFO L279 TraceCheckSpWp]: Computing forward predicates...