./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pj_icu.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.pj_icu.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 81684cd6f6f9906a1fa983a1abdb27554546d8d43af37740ea6944465197b3b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:47:41,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:47:41,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:47:41,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:47:41,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:47:41,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:47:41,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:47:41,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:47:41,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:47:41,797 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:47:41,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:47:41,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:47:41,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:47:41,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:47:41,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:47:41,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:47:41,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:47:41,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:47:41,799 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 -> 81684cd6f6f9906a1fa983a1abdb27554546d8d43af37740ea6944465197b3b8 [2025-02-07 23:47:41,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:47:41,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:47:42,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:47:42,001 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:47:42,001 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:47:42,002 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.pj_icu.c [2025-02-07 23:47:43,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac4aa5664/e8273b3d4796428eaa7aeb835f01e58f/FLAG71de71d37 [2025-02-07 23:47:43,529 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:47:43,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pj_icu.c [2025-02-07 23:47:43,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac4aa5664/e8273b3d4796428eaa7aeb835f01e58f/FLAG71de71d37 [2025-02-07 23:47:43,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac4aa5664/e8273b3d4796428eaa7aeb835f01e58f [2025-02-07 23:47:43,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:47:43,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:47:43,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:47:43,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:47:43,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:47:43,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:47:43" (1/1) ... [2025-02-07 23:47:43,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:43, skipping insertion in model container [2025-02-07 23:47:43,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:47:43" (1/1) ... [2025-02-07 23:47:43,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:47:43,741 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.pj_icu.c[1246,1259] [2025-02-07 23:47:44,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:47:44,018 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:47:44,025 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.pj_icu.c[1246,1259] [2025-02-07 23:47:44,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:47:44,186 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:47:44,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44 WrapperNode [2025-02-07 23:47:44,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:47:44,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:47:44,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:47:44,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:47:44,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:44,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:44,681 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5178 [2025-02-07 23:47:44,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:47:44,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:47:44,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:47:44,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:47:44,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:44,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:44,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,044 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-07 23:47:45,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:47:45,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:47:45,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:47:45,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:47:45,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (1/1) ... [2025-02-07 23:47:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:47:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:47:45,232 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-07 23:47:45,237 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-07 23:47:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:47:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:47:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:47:45,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:47:45,735 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:47:45,736 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:47:49,113 INFO L? ?]: Removed 3375 outVars from TransFormulas that were not future-live. [2025-02-07 23:47:49,113 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:47:49,234 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:47:49,234 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:47:49,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:47:49 BoogieIcfgContainer [2025-02-07 23:47:49,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:47:49,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:47:49,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:47:49,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:47:49,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:47:43" (1/3) ... [2025-02-07 23:47:49,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a16426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:47:49, skipping insertion in model container [2025-02-07 23:47:49,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:47:44" (2/3) ... [2025-02-07 23:47:49,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a16426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:47:49, skipping insertion in model container [2025-02-07 23:47:49,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:47:49" (3/3) ... [2025-02-07 23:47:49,242 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.pj_icu.c [2025-02-07 23:47:49,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:47:49,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.pj_icu.c that has 1 procedures, 1212 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:47:49,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:47:49,319 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;@6f10faaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:47:49,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:47:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 1212 states, 1210 states have (on average 1.5) internal successors, (1815), 1211 states have internal predecessors, (1815), 0 states have call successors, (0), 0 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-07 23:47:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-07 23:47:49,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:47:49,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:47:49,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:47:49,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:47:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash 19211214, now seen corresponding path program 1 times [2025-02-07 23:47:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:47:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216112372] [2025-02-07 23:47:49,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:47:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:47:49,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-07 23:47:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-07 23:47:49,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:47:49,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:47:50,323 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-07 23:47:50,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:47:50,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216112372] [2025-02-07 23:47:50,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216112372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:47:50,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:47:50,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:47:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963598208] [2025-02-07 23:47:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:47:50,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:47:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:47:50,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:47:50,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:47:50,348 INFO L87 Difference]: Start difference. First operand has 1212 states, 1210 states have (on average 1.5) internal successors, (1815), 1211 states have internal predecessors, (1815), 0 states have call successors, (0), 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 33.0) internal successors, (132), 4 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-07 23:47:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:47:50,934 INFO L93 Difference]: Finished difference Result 2307 states and 3457 transitions. [2025-02-07 23:47:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:47:50,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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-07 23:47:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:47:50,948 INFO L225 Difference]: With dead ends: 2307 [2025-02-07 23:47:50,948 INFO L226 Difference]: Without dead ends: 1212 [2025-02-07 23:47:50,951 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-07 23:47:50,953 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 0 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:47:50,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4522 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:47:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2025-02-07 23:47:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2025-02-07 23:47:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.4979355904211396) internal successors, (1814), 1211 states have internal predecessors, (1814), 0 states have call successors, (0), 0 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-07 23:47:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1814 transitions. [2025-02-07 23:47:51,008 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1814 transitions. Word has length 132 [2025-02-07 23:47:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:47:51,008 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1814 transitions. [2025-02-07 23:47:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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-07 23:47:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1814 transitions. [2025-02-07 23:47:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-07 23:47:51,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:47:51,010 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-07 23:47:51,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:47:51,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:47:51,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:47:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash 600228436, now seen corresponding path program 1 times [2025-02-07 23:47:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:47:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278122912] [2025-02-07 23:47:51,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:47:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:47:51,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-07 23:47:51,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-07 23:47:51,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:47:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:47:51,384 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-07 23:47:51,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:47:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278122912] [2025-02-07 23:47:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278122912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:47:51,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:47:51,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:47:51,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891149072] [2025-02-07 23:47:51,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:47:51,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:47:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:47:51,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:47:51,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:47:51,388 INFO L87 Difference]: Start difference. First operand 1212 states and 1814 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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-07 23:47:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:47:51,856 INFO L93 Difference]: Finished difference Result 2309 states and 3456 transitions. [2025-02-07 23:47:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:47:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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-07 23:47:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:47:51,861 INFO L225 Difference]: With dead ends: 2309 [2025-02-07 23:47:51,863 INFO L226 Difference]: Without dead ends: 1214 [2025-02-07 23:47:51,865 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-07 23:47:51,866 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 0 mSDsluCounter, 3010 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4519 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:47:51,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4519 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:47:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-02-07 23:47:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2025-02-07 23:47:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4971145919208573) internal successors, (1816), 1213 states have internal predecessors, (1816), 0 states have call successors, (0), 0 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-07 23:47:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1816 transitions. [2025-02-07 23:47:51,893 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1816 transitions. Word has length 133 [2025-02-07 23:47:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:47:51,894 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1816 transitions. [2025-02-07 23:47:51,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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-07 23:47:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1816 transitions. [2025-02-07 23:47:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-07 23:47:51,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:47:51,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:47:51,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:47:51,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:47:51,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:47:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -936244087, now seen corresponding path program 1 times [2025-02-07 23:47:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:47:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510629050] [2025-02-07 23:47:51,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:47:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:47:51,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-07 23:47:52,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-07 23:47:52,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:47:52,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:47:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:47:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:47:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510629050] [2025-02-07 23:47:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510629050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:47:52,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:47:52,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:47:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341632255] [2025-02-07 23:47:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:47:52,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:47:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:47:52,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:47:52,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:47:52,585 INFO L87 Difference]: Start difference. First operand 1214 states and 1816 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 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-07 23:47:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:47:53,305 INFO L93 Difference]: Finished difference Result 2315 states and 3463 transitions. [2025-02-07 23:47:53,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:47:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 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-07 23:47:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:47:53,309 INFO L225 Difference]: With dead ends: 2315 [2025-02-07 23:47:53,309 INFO L226 Difference]: Without dead ends: 1218 [2025-02-07 23:47:53,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:47:53,311 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1692 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 4514 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:47:53,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 4514 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:47:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-02-07 23:47:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1217. [2025-02-07 23:47:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.495888157894737) internal successors, (1819), 1216 states have internal predecessors, (1819), 0 states have call successors, (0), 0 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-07 23:47:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1819 transitions. [2025-02-07 23:47:53,330 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1819 transitions. Word has length 134 [2025-02-07 23:47:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:47:53,330 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1819 transitions. [2025-02-07 23:47:53,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 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-07 23:47:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1819 transitions. [2025-02-07 23:47:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-07 23:47:53,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:47:53,331 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-07 23:47:53,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:47:53,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:47:53,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:47:53,332 INFO L85 PathProgramCache]: Analyzing trace with hash 268665132, now seen corresponding path program 1 times [2025-02-07 23:47:53,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:47:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546906517] [2025-02-07 23:47:53,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:47:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:47:53,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-07 23:47:53,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-07 23:47:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:47:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:47:55,109 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-07 23:47:55,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:47:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546906517] [2025-02-07 23:47:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546906517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:47:55,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:47:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:47:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907011394] [2025-02-07 23:47:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:47:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:47:55,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:47:55,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:47:55,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:47:55,110 INFO L87 Difference]: Start difference. First operand 1217 states and 1819 transitions. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-07 23:47:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:47:56,646 INFO L93 Difference]: Finished difference Result 3316 states and 4956 transitions. [2025-02-07 23:47:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:47:56,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-02-07 23:47:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:47:56,653 INFO L225 Difference]: With dead ends: 3316 [2025-02-07 23:47:56,653 INFO L226 Difference]: Without dead ends: 2216 [2025-02-07 23:47:56,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:47:56,657 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 3223 mSDsluCounter, 8813 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3223 SdHoareTripleChecker+Valid, 10283 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:47:56,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3223 Valid, 10283 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 23:47:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2025-02-07 23:47:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1262. [2025-02-07 23:47:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.4948453608247423) internal successors, (1885), 1261 states have internal predecessors, (1885), 0 states have call successors, (0), 0 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-07 23:47:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1885 transitions. [2025-02-07 23:47:56,692 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1885 transitions. Word has length 135 [2025-02-07 23:47:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:47:56,693 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1885 transitions. [2025-02-07 23:47:56,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-07 23:47:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1885 transitions. [2025-02-07 23:47:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-07 23:47:56,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:47:56,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:47:56,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:47:56,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:47:56,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:47:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2113503885, now seen corresponding path program 1 times [2025-02-07 23:47:56,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:47:56,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102023957] [2025-02-07 23:47:56,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:47:56,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:47:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-07 23:47:56,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-07 23:47:56,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:47:56,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:47:57,279 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-07 23:47:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:47:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102023957] [2025-02-07 23:47:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102023957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:47:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:47:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:47:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626675803] [2025-02-07 23:47:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:47:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:47:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:47:57,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:47:57,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:47:57,282 INFO L87 Difference]: Start difference. First operand 1262 states and 1885 transitions. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-07 23:47:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:47:58,326 INFO L93 Difference]: Finished difference Result 3319 states and 4957 transitions. [2025-02-07 23:47:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:47:58,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-07 23:47:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:47:58,332 INFO L225 Difference]: With dead ends: 3319 [2025-02-07 23:47:58,332 INFO L226 Difference]: Without dead ends: 2216 [2025-02-07 23:47:58,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:47:58,335 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 4682 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4682 SdHoareTripleChecker+Valid, 7369 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:47:58,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4682 Valid, 7369 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 23:47:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2025-02-07 23:47:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1268. [2025-02-07 23:47:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.4917127071823204) internal successors, (1890), 1267 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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-07 23:47:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1890 transitions. [2025-02-07 23:47:58,356 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1890 transitions. Word has length 136 [2025-02-07 23:47:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:47:58,356 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1890 transitions. [2025-02-07 23:47:58,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-07 23:47:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1890 transitions. [2025-02-07 23:47:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-07 23:47:58,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:47:58,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:47:58,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:47:58,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:47:58,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:47:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 502051697, now seen corresponding path program 1 times [2025-02-07 23:47:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:47:58,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868172016] [2025-02-07 23:47:58,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:47:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:47:58,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-07 23:47:58,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-07 23:47:58,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:47:58,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:47:59,220 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-07 23:47:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:47:59,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868172016] [2025-02-07 23:47:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868172016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:47:59,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:47:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:47:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490859193] [2025-02-07 23:47:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:47:59,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:47:59,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:47:59,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:47:59,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:47:59,222 INFO L87 Difference]: Start difference. First operand 1268 states and 1890 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-07 23:48:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:00,228 INFO L93 Difference]: Finished difference Result 3320 states and 4956 transitions. [2025-02-07 23:48:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-02-07 23:48:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:00,235 INFO L225 Difference]: With dead ends: 3320 [2025-02-07 23:48:00,235 INFO L226 Difference]: Without dead ends: 2220 [2025-02-07 23:48:00,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:48:00,237 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 4624 mSDsluCounter, 5887 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 7360 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:00,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 7360 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:48:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2025-02-07 23:48:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1309. [2025-02-07 23:48:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1308 states have (on average 1.4908256880733946) internal successors, (1950), 1308 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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-07 23:48:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1950 transitions. [2025-02-07 23:48:00,257 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1950 transitions. Word has length 137 [2025-02-07 23:48:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:00,257 INFO L471 AbstractCegarLoop]: Abstraction has 1309 states and 1950 transitions. [2025-02-07 23:48:00,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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-07 23:48:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1950 transitions. [2025-02-07 23:48:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-07 23:48:00,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:00,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:00,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:48:00,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:00,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1849233216, now seen corresponding path program 1 times [2025-02-07 23:48:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:00,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815767615] [2025-02-07 23:48:00,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:00,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-07 23:48:00,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-07 23:48:00,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:00,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:01,147 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-07 23:48:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815767615] [2025-02-07 23:48:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815767615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:01,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:01,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299520544] [2025-02-07 23:48:01,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:01,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:01,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:01,148 INFO L87 Difference]: Start difference. First operand 1309 states and 1950 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-07 23:48:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:02,193 INFO L93 Difference]: Finished difference Result 3322 states and 4957 transitions. [2025-02-07 23:48:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-07 23:48:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:02,199 INFO L225 Difference]: With dead ends: 3322 [2025-02-07 23:48:02,199 INFO L226 Difference]: Without dead ends: 2222 [2025-02-07 23:48:02,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:02,201 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 4660 mSDsluCounter, 5892 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4660 SdHoareTripleChecker+Valid, 7367 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:02,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4660 Valid, 7367 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 23:48:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-02-07 23:48:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 1315. [2025-02-07 23:48:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1314 states have (on average 1.4901065449010655) internal successors, (1958), 1314 states have internal predecessors, (1958), 0 states have call successors, (0), 0 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-07 23:48:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1958 transitions. [2025-02-07 23:48:02,225 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1958 transitions. Word has length 138 [2025-02-07 23:48:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:02,226 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1958 transitions. [2025-02-07 23:48:02,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-07 23:48:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1958 transitions. [2025-02-07 23:48:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-07 23:48:02,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:02,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:48:02,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1483206875, now seen corresponding path program 1 times [2025-02-07 23:48:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48760060] [2025-02-07 23:48:02,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:02,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-07 23:48:02,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-07 23:48:02,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:02,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:02,791 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-07 23:48:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48760060] [2025-02-07 23:48:02,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48760060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:02,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:02,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:02,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419349951] [2025-02-07 23:48:02,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:02,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:48:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:02,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:48:02,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:48:02,793 INFO L87 Difference]: Start difference. First operand 1315 states and 1958 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-07 23:48:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:03,413 INFO L93 Difference]: Finished difference Result 2419 states and 3609 transitions. [2025-02-07 23:48:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:48:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-07 23:48:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:03,416 INFO L225 Difference]: With dead ends: 2419 [2025-02-07 23:48:03,417 INFO L226 Difference]: Without dead ends: 1319 [2025-02-07 23:48:03,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-07 23:48:03,418 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 2 mSDsluCounter, 4504 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6008 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:03,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6008 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:48:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-02-07 23:48:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2025-02-07 23:48:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.4893778452200304) internal successors, (1963), 1318 states have internal predecessors, (1963), 0 states have call successors, (0), 0 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-07 23:48:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1963 transitions. [2025-02-07 23:48:03,435 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1963 transitions. Word has length 139 [2025-02-07 23:48:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:03,435 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1963 transitions. [2025-02-07 23:48:03,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-07 23:48:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1963 transitions. [2025-02-07 23:48:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-07 23:48:03,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:03,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:03,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:48:03,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:03,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash -123823850, now seen corresponding path program 1 times [2025-02-07 23:48:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:03,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858906477] [2025-02-07 23:48:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:03,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-07 23:48:03,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-07 23:48:03,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:03,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:04,149 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-07 23:48:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858906477] [2025-02-07 23:48:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858906477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195477569] [2025-02-07 23:48:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:48:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:48:04,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:48:04,151 INFO L87 Difference]: Start difference. First operand 1319 states and 1963 transitions. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-07 23:48:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:05,190 INFO L93 Difference]: Finished difference Result 2524 states and 3754 transitions. [2025-02-07 23:48:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:48:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-07 23:48:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:05,193 INFO L225 Difference]: With dead ends: 2524 [2025-02-07 23:48:05,193 INFO L226 Difference]: Without dead ends: 1384 [2025-02-07 23:48:05,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:48:05,195 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 2150 mSDsluCounter, 8859 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 10337 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:05,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 10337 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 23:48:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-02-07 23:48:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1343. [2025-02-07 23:48:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 1.4843517138599105) internal successors, (1992), 1342 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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-07 23:48:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1992 transitions. [2025-02-07 23:48:05,210 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1992 transitions. Word has length 139 [2025-02-07 23:48:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:05,211 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1992 transitions. [2025-02-07 23:48:05,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-07 23:48:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1992 transitions. [2025-02-07 23:48:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-07 23:48:05,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:05,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:05,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:48:05,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:05,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1406812104, now seen corresponding path program 1 times [2025-02-07 23:48:05,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:05,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690571697] [2025-02-07 23:48:05,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:05,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-07 23:48:05,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-07 23:48:05,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:05,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:05,745 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-07 23:48:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690571697] [2025-02-07 23:48:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690571697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:05,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:05,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559341920] [2025-02-07 23:48:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:05,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:05,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:05,747 INFO L87 Difference]: Start difference. First operand 1343 states and 1992 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-07 23:48:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:06,646 INFO L93 Difference]: Finished difference Result 2524 states and 3753 transitions. [2025-02-07 23:48:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:48:06,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-02-07 23:48:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:06,649 INFO L225 Difference]: With dead ends: 2524 [2025-02-07 23:48:06,649 INFO L226 Difference]: Without dead ends: 1379 [2025-02-07 23:48:06,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:48:06,651 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2100 mSDsluCounter, 5904 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 7383 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:06,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 7383 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:48:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-02-07 23:48:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1341. [2025-02-07 23:48:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1340 states have (on average 1.4828358208955223) internal successors, (1987), 1340 states have internal predecessors, (1987), 0 states have call successors, (0), 0 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-07 23:48:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1987 transitions. [2025-02-07 23:48:06,665 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1987 transitions. Word has length 140 [2025-02-07 23:48:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:06,665 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1987 transitions. [2025-02-07 23:48:06,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-07 23:48:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1987 transitions. [2025-02-07 23:48:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-07 23:48:06,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:06,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:06,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:48:06,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:06,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 618227581, now seen corresponding path program 1 times [2025-02-07 23:48:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346661107] [2025-02-07 23:48:06,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:06,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:06,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-07 23:48:06,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-07 23:48:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:07,088 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-07 23:48:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346661107] [2025-02-07 23:48:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346661107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:07,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:48:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166912209] [2025-02-07 23:48:07,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:07,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:48:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:07,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:48:07,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:07,089 INFO L87 Difference]: Start difference. First operand 1341 states and 1987 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-07 23:48:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:08,118 INFO L93 Difference]: Finished difference Result 2542 states and 3770 transitions. [2025-02-07 23:48:08,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:48:08,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-02-07 23:48:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:08,122 INFO L225 Difference]: With dead ends: 2542 [2025-02-07 23:48:08,122 INFO L226 Difference]: Without dead ends: 1353 [2025-02-07 23:48:08,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:48:08,125 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2129 mSDsluCounter, 7386 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 8865 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:08,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 8865 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:48:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-02-07 23:48:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1315. [2025-02-07 23:48:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1314 states have (on average 1.4863013698630136) internal successors, (1953), 1314 states have internal predecessors, (1953), 0 states have call successors, (0), 0 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-07 23:48:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1953 transitions. [2025-02-07 23:48:08,138 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1953 transitions. Word has length 140 [2025-02-07 23:48:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:08,138 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1953 transitions. [2025-02-07 23:48:08,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-07 23:48:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1953 transitions. [2025-02-07 23:48:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-07 23:48:08,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:08,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:08,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:48:08,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash -702206843, now seen corresponding path program 1 times [2025-02-07 23:48:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943707760] [2025-02-07 23:48:08,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:08,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-07 23:48:08,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-07 23:48:08,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:08,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:08,846 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-07 23:48:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:08,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943707760] [2025-02-07 23:48:08,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943707760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:08,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:08,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:48:08,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86971169] [2025-02-07 23:48:08,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:08,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:48:08,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:08,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:48:08,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:48:08,850 INFO L87 Difference]: Start difference. First operand 1315 states and 1953 transitions. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-07 23:48:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:09,905 INFO L93 Difference]: Finished difference Result 2488 states and 3702 transitions. [2025-02-07 23:48:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:48:09,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-02-07 23:48:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:09,910 INFO L225 Difference]: With dead ends: 2488 [2025-02-07 23:48:09,912 INFO L226 Difference]: Without dead ends: 1353 [2025-02-07 23:48:09,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-02-07 23:48:09,918 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 2067 mSDsluCounter, 7608 mSDsCounter, 0 mSdLazyCounter, 2129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 9083 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:09,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 9083 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2129 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 23:48:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-02-07 23:48:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1315. [2025-02-07 23:48:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1314 states have (on average 1.4855403348554033) internal successors, (1952), 1314 states have internal predecessors, (1952), 0 states have call successors, (0), 0 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-07 23:48:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1952 transitions. [2025-02-07 23:48:09,947 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1952 transitions. Word has length 141 [2025-02-07 23:48:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1952 transitions. [2025-02-07 23:48:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 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-07 23:48:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1952 transitions. [2025-02-07 23:48:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-07 23:48:09,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:09,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:09,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:48:09,948 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:09,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1716259213, now seen corresponding path program 1 times [2025-02-07 23:48:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:09,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572110352] [2025-02-07 23:48:09,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:09,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-07 23:48:10,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-07 23:48:10,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:10,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:10,408 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-07 23:48:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572110352] [2025-02-07 23:48:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572110352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:10,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623407588] [2025-02-07 23:48:10,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:10,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:10,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:10,410 INFO L87 Difference]: Start difference. First operand 1315 states and 1952 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-07 23:48:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:11,045 INFO L93 Difference]: Finished difference Result 2488 states and 3701 transitions. [2025-02-07 23:48:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-02-07 23:48:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:11,049 INFO L225 Difference]: With dead ends: 2488 [2025-02-07 23:48:11,049 INFO L226 Difference]: Without dead ends: 1357 [2025-02-07 23:48:11,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:11,050 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2075 mSDsluCounter, 3201 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:11,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 4680 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:48:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-02-07 23:48:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1317. [2025-02-07 23:48:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.4848024316109423) internal successors, (1954), 1316 states have internal predecessors, (1954), 0 states have call successors, (0), 0 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-07 23:48:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1954 transitions. [2025-02-07 23:48:11,063 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1954 transitions. Word has length 142 [2025-02-07 23:48:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:11,063 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1954 transitions. [2025-02-07 23:48:11,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 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-07 23:48:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1954 transitions. [2025-02-07 23:48:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-07 23:48:11,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:11,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:48:11,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1475715660, now seen corresponding path program 1 times [2025-02-07 23:48:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226400642] [2025-02-07 23:48:11,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:11,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-07 23:48:11,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-07 23:48:11,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:11,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:11,370 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-07 23:48:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226400642] [2025-02-07 23:48:11,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226400642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:11,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:11,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307436629] [2025-02-07 23:48:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:11,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:11,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:11,371 INFO L87 Difference]: Start difference. First operand 1317 states and 1954 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-07 23:48:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:11,924 INFO L93 Difference]: Finished difference Result 2488 states and 3700 transitions. [2025-02-07 23:48:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-02-07 23:48:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:11,927 INFO L225 Difference]: With dead ends: 2488 [2025-02-07 23:48:11,927 INFO L226 Difference]: Without dead ends: 1352 [2025-02-07 23:48:11,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:11,929 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2059 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:11,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2059 Valid, 4439 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-02-07 23:48:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1314. [2025-02-07 23:48:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.4843869002284844) internal successors, (1949), 1313 states have internal predecessors, (1949), 0 states have call successors, (0), 0 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-07 23:48:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1949 transitions. [2025-02-07 23:48:11,941 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1949 transitions. Word has length 143 [2025-02-07 23:48:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:11,942 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1949 transitions. [2025-02-07 23:48:11,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-07 23:48:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1949 transitions. [2025-02-07 23:48:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-07 23:48:11,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:11,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:11,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 23:48:11,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -867533814, now seen corresponding path program 1 times [2025-02-07 23:48:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541565165] [2025-02-07 23:48:11,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:11,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-07 23:48:12,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-07 23:48:12,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:12,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:12,641 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-07 23:48:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541565165] [2025-02-07 23:48:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541565165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:12,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:12,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:12,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357420783] [2025-02-07 23:48:12,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:12,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:48:12,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:48:12,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:48:12,643 INFO L87 Difference]: Start difference. First operand 1314 states and 1949 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-07 23:48:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:13,530 INFO L93 Difference]: Finished difference Result 2483 states and 3692 transitions. [2025-02-07 23:48:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:48:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-02-07 23:48:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:13,533 INFO L225 Difference]: With dead ends: 2483 [2025-02-07 23:48:13,533 INFO L226 Difference]: Without dead ends: 1356 [2025-02-07 23:48:13,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:48:13,535 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 2065 mSDsluCounter, 6140 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2065 SdHoareTripleChecker+Valid, 7617 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:13,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2065 Valid, 7617 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:48:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-02-07 23:48:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1316. [2025-02-07 23:48:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 1.4836501901140684) internal successors, (1951), 1315 states have internal predecessors, (1951), 0 states have call successors, (0), 0 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-07 23:48:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1951 transitions. [2025-02-07 23:48:13,549 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1951 transitions. Word has length 143 [2025-02-07 23:48:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:13,549 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1951 transitions. [2025-02-07 23:48:13,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 0 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-07 23:48:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1951 transitions. [2025-02-07 23:48:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-07 23:48:13,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:13,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:13,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:48:13,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1044092840, now seen corresponding path program 1 times [2025-02-07 23:48:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:13,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688002830] [2025-02-07 23:48:13,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:13,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:13,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-07 23:48:13,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-07 23:48:13,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:13,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:14,029 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-07 23:48:14,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688002830] [2025-02-07 23:48:14,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688002830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:14,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:14,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787355379] [2025-02-07 23:48:14,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:14,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:14,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:14,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:14,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:14,032 INFO L87 Difference]: Start difference. First operand 1316 states and 1951 transitions. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-07 23:48:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:14,771 INFO L93 Difference]: Finished difference Result 2481 states and 3688 transitions. [2025-02-07 23:48:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-02-07 23:48:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:14,774 INFO L225 Difference]: With dead ends: 2481 [2025-02-07 23:48:14,774 INFO L226 Difference]: Without dead ends: 1358 [2025-02-07 23:48:14,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:14,778 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 2062 mSDsluCounter, 4545 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 6022 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:14,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 6022 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:48:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-02-07 23:48:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1318. [2025-02-07 23:48:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.4829157175398633) internal successors, (1953), 1317 states have internal predecessors, (1953), 0 states have call successors, (0), 0 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-07 23:48:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1953 transitions. [2025-02-07 23:48:14,793 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1953 transitions. Word has length 144 [2025-02-07 23:48:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:14,793 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1953 transitions. [2025-02-07 23:48:14,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 6 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-07 23:48:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1953 transitions. [2025-02-07 23:48:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-07 23:48:14,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:14,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:14,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:48:14,795 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1319023684, now seen corresponding path program 1 times [2025-02-07 23:48:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031533882] [2025-02-07 23:48:14,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:14,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-07 23:48:14,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-07 23:48:14,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:14,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:15,076 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-07 23:48:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031533882] [2025-02-07 23:48:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031533882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:15,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178532684] [2025-02-07 23:48:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:15,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:15,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:15,078 INFO L87 Difference]: Start difference. First operand 1318 states and 1953 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-07 23:48:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:15,645 INFO L93 Difference]: Finished difference Result 2487 states and 3695 transitions. [2025-02-07 23:48:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:15,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-02-07 23:48:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:15,648 INFO L225 Difference]: With dead ends: 2487 [2025-02-07 23:48:15,648 INFO L226 Difference]: Without dead ends: 1353 [2025-02-07 23:48:15,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:15,649 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2050 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:15,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 4439 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-02-07 23:48:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1315. [2025-02-07 23:48:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1314 states have (on average 1.482496194824962) internal successors, (1948), 1314 states have internal predecessors, (1948), 0 states have call successors, (0), 0 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-07 23:48:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1948 transitions. [2025-02-07 23:48:15,658 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1948 transitions. Word has length 144 [2025-02-07 23:48:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:15,658 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1948 transitions. [2025-02-07 23:48:15,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-07 23:48:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1948 transitions. [2025-02-07 23:48:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-07 23:48:15,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:15,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:15,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 23:48:15,659 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:15,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash -918175217, now seen corresponding path program 1 times [2025-02-07 23:48:15,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:15,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103371925] [2025-02-07 23:48:15,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:15,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-07 23:48:15,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-07 23:48:15,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:15,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:16,299 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-07 23:48:16,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:16,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103371925] [2025-02-07 23:48:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103371925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:16,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:48:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687910131] [2025-02-07 23:48:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:16,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:48:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:16,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:48:16,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:48:16,301 INFO L87 Difference]: Start difference. First operand 1315 states and 1948 transitions. Second operand has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 12 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-07 23:48:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:17,628 INFO L93 Difference]: Finished difference Result 2476 states and 3679 transitions. [2025-02-07 23:48:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 23:48:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 12 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-02-07 23:48:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:17,633 INFO L225 Difference]: With dead ends: 2476 [2025-02-07 23:48:17,633 INFO L226 Difference]: Without dead ends: 1357 [2025-02-07 23:48:17,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-02-07 23:48:17,636 INFO L435 NwaCegarLoop]: 1472 mSDtfsCounter, 2057 mSDsluCounter, 10625 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 12097 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:17,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 12097 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 23:48:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-02-07 23:48:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1317. [2025-02-07 23:48:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.4817629179331306) internal successors, (1950), 1316 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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-07 23:48:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1950 transitions. [2025-02-07 23:48:17,646 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1950 transitions. Word has length 145 [2025-02-07 23:48:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:17,646 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1950 transitions. [2025-02-07 23:48:17,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 12 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-07 23:48:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1950 transitions. [2025-02-07 23:48:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-07 23:48:17,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:17,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 23:48:17,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1078271597, now seen corresponding path program 1 times [2025-02-07 23:48:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821662674] [2025-02-07 23:48:17,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:17,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-07 23:48:17,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-07 23:48:17,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:17,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:17,912 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-07 23:48:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821662674] [2025-02-07 23:48:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821662674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:17,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:17,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846145954] [2025-02-07 23:48:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:17,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:17,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:17,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:17,914 INFO L87 Difference]: Start difference. First operand 1317 states and 1950 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-07 23:48:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:18,441 INFO L93 Difference]: Finished difference Result 2482 states and 3686 transitions. [2025-02-07 23:48:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-02-07 23:48:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:18,443 INFO L225 Difference]: With dead ends: 2482 [2025-02-07 23:48:18,443 INFO L226 Difference]: Without dead ends: 1352 [2025-02-07 23:48:18,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:18,445 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2041 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2041 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:18,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2041 Valid, 4439 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-02-07 23:48:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1314. [2025-02-07 23:48:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.4813404417364813) internal successors, (1945), 1313 states have internal predecessors, (1945), 0 states have call successors, (0), 0 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-07 23:48:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1945 transitions. [2025-02-07 23:48:18,454 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1945 transitions. Word has length 145 [2025-02-07 23:48:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1945 transitions. [2025-02-07 23:48:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-07 23:48:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1945 transitions. [2025-02-07 23:48:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-07 23:48:18,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:18,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:18,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 23:48:18,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:18,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1643534147, now seen corresponding path program 1 times [2025-02-07 23:48:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910062525] [2025-02-07 23:48:18,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:18,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-07 23:48:18,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-07 23:48:18,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:18,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:19,031 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-07 23:48:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:19,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910062525] [2025-02-07 23:48:19,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910062525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:19,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:19,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:19,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197283965] [2025-02-07 23:48:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:19,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:19,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:19,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:19,034 INFO L87 Difference]: Start difference. First operand 1314 states and 1945 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 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-07 23:48:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:19,525 INFO L93 Difference]: Finished difference Result 2541 states and 3759 transitions. [2025-02-07 23:48:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-07 23:48:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:19,528 INFO L225 Difference]: With dead ends: 2541 [2025-02-07 23:48:19,528 INFO L226 Difference]: Without dead ends: 1352 [2025-02-07 23:48:19,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:48:19,529 INFO L435 NwaCegarLoop]: 1480 mSDtfsCounter, 1915 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1915 SdHoareTripleChecker+Valid, 4438 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:19,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1915 Valid, 4438 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-02-07 23:48:19,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1314. [2025-02-07 23:48:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.4805788271134805) internal successors, (1944), 1313 states have internal predecessors, (1944), 0 states have call successors, (0), 0 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-07 23:48:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1944 transitions. [2025-02-07 23:48:19,538 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1944 transitions. Word has length 146 [2025-02-07 23:48:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1944 transitions. [2025-02-07 23:48:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 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-07 23:48:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1944 transitions. [2025-02-07 23:48:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-07 23:48:19,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:19,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:19,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 23:48:19,540 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash -735541944, now seen corresponding path program 1 times [2025-02-07 23:48:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563815080] [2025-02-07 23:48:19,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:19,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-07 23:48:19,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-07 23:48:19,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:19,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:19,947 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-07 23:48:19,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:19,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563815080] [2025-02-07 23:48:19,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563815080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:19,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:19,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:19,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238294425] [2025-02-07 23:48:19,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:19,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:19,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:19,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:19,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:19,949 INFO L87 Difference]: Start difference. First operand 1314 states and 1944 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-07 23:48:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:20,491 INFO L93 Difference]: Finished difference Result 2541 states and 3758 transitions. [2025-02-07 23:48:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:20,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-02-07 23:48:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:20,496 INFO L225 Difference]: With dead ends: 2541 [2025-02-07 23:48:20,496 INFO L226 Difference]: Without dead ends: 1356 [2025-02-07 23:48:20,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:20,498 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 2085 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 4651 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:20,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2085 Valid, 4651 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-02-07 23:48:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1316. [2025-02-07 23:48:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 1.4798479087452472) internal successors, (1946), 1315 states have internal predecessors, (1946), 0 states have call successors, (0), 0 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-07 23:48:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1946 transitions. [2025-02-07 23:48:20,513 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1946 transitions. Word has length 147 [2025-02-07 23:48:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:20,513 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1946 transitions. [2025-02-07 23:48:20,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-07 23:48:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1946 transitions. [2025-02-07 23:48:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-07 23:48:20,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:20,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:20,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 23:48:20,514 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:20,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1048712648, now seen corresponding path program 1 times [2025-02-07 23:48:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061089482] [2025-02-07 23:48:20,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:20,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-07 23:48:20,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-07 23:48:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:21,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-07 23:48:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061089482] [2025-02-07 23:48:21,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061089482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:21,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:48:21,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377636210] [2025-02-07 23:48:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:21,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:48:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:21,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:48:21,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:21,159 INFO L87 Difference]: Start difference. First operand 1316 states and 1946 transitions. Second operand has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 10 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-07 23:48:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:22,055 INFO L93 Difference]: Finished difference Result 2541 states and 3757 transitions. [2025-02-07 23:48:22,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 23:48:22,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 10 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-02-07 23:48:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:22,059 INFO L225 Difference]: With dead ends: 2541 [2025-02-07 23:48:22,059 INFO L226 Difference]: Without dead ends: 1364 [2025-02-07 23:48:22,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-02-07 23:48:22,062 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 2102 mSDsluCounter, 7691 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 9164 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:22,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 9164 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:48:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-02-07 23:48:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1322. [2025-02-07 23:48:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1321 states have (on average 1.4799394398183194) internal successors, (1955), 1321 states have internal predecessors, (1955), 0 states have call successors, (0), 0 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-07 23:48:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1955 transitions. [2025-02-07 23:48:22,071 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1955 transitions. Word has length 148 [2025-02-07 23:48:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:22,071 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 1955 transitions. [2025-02-07 23:48:22,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 10 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-07 23:48:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1955 transitions. [2025-02-07 23:48:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-07 23:48:22,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:22,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:22,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 23:48:22,072 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:22,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 285422327, now seen corresponding path program 1 times [2025-02-07 23:48:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:22,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315702346] [2025-02-07 23:48:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:22,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-07 23:48:22,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-07 23:48:22,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:22,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:22,358 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-07 23:48:22,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:22,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315702346] [2025-02-07 23:48:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315702346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:22,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029086488] [2025-02-07 23:48:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:22,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:22,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:22,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:22,360 INFO L87 Difference]: Start difference. First operand 1322 states and 1955 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-07 23:48:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:22,818 INFO L93 Difference]: Finished difference Result 2546 states and 3764 transitions. [2025-02-07 23:48:22,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:22,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-02-07 23:48:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:22,821 INFO L225 Difference]: With dead ends: 2546 [2025-02-07 23:48:22,821 INFO L226 Difference]: Without dead ends: 1356 [2025-02-07 23:48:22,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:22,822 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2069 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:22,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 4439 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:48:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-02-07 23:48:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1318. [2025-02-07 23:48:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.4791192103264996) internal successors, (1948), 1317 states have internal predecessors, (1948), 0 states have call successors, (0), 0 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-07 23:48:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1948 transitions. [2025-02-07 23:48:22,831 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1948 transitions. Word has length 148 [2025-02-07 23:48:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1948 transitions. [2025-02-07 23:48:22,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 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-07 23:48:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1948 transitions. [2025-02-07 23:48:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-07 23:48:22,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:22,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:22,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 23:48:22,832 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:22,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:22,832 INFO L85 PathProgramCache]: Analyzing trace with hash -854322242, now seen corresponding path program 1 times [2025-02-07 23:48:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443038071] [2025-02-07 23:48:22,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:22,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-07 23:48:22,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-07 23:48:22,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:22,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:23,285 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-07 23:48:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443038071] [2025-02-07 23:48:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443038071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290513035] [2025-02-07 23:48:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:23,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:48:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:23,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:48:23,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:48:23,287 INFO L87 Difference]: Start difference. First operand 1318 states and 1948 transitions. Second operand has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 8 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-07 23:48:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:24,147 INFO L93 Difference]: Finished difference Result 2538 states and 3750 transitions. [2025-02-07 23:48:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:48:24,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 8 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-07 23:48:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:24,149 INFO L225 Difference]: With dead ends: 2538 [2025-02-07 23:48:24,149 INFO L226 Difference]: Without dead ends: 1357 [2025-02-07 23:48:24,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:48:24,150 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 2075 mSDsluCounter, 6122 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 7598 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:24,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 7598 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:48:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-02-07 23:48:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1318. [2025-02-07 23:48:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.4783599088838268) internal successors, (1947), 1317 states have internal predecessors, (1947), 0 states have call successors, (0), 0 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-07 23:48:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1947 transitions. [2025-02-07 23:48:24,159 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1947 transitions. Word has length 149 [2025-02-07 23:48:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1947 transitions. [2025-02-07 23:48:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.555555555555557) internal successors, (149), 8 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-07 23:48:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1947 transitions. [2025-02-07 23:48:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-07 23:48:24,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:24,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:24,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 23:48:24,161 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1136261700, now seen corresponding path program 1 times [2025-02-07 23:48:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745002433] [2025-02-07 23:48:24,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:24,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-07 23:48:24,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-07 23:48:24,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:24,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:24,423 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-07 23:48:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:24,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745002433] [2025-02-07 23:48:24,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745002433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:24,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:24,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998349342] [2025-02-07 23:48:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:24,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:24,425 INFO L87 Difference]: Start difference. First operand 1318 states and 1947 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-07 23:48:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:24,976 INFO L93 Difference]: Finished difference Result 2538 states and 3750 transitions. [2025-02-07 23:48:24,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:24,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-07 23:48:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:24,978 INFO L225 Difference]: With dead ends: 2538 [2025-02-07 23:48:24,978 INFO L226 Difference]: Without dead ends: 1352 [2025-02-07 23:48:24,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:24,980 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2060 mSDsluCounter, 2954 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:24,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 4433 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2025-02-07 23:48:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1314. [2025-02-07 23:48:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.4775323686214776) internal successors, (1940), 1313 states have internal predecessors, (1940), 0 states have call successors, (0), 0 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-07 23:48:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1940 transitions. [2025-02-07 23:48:24,988 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1940 transitions. Word has length 149 [2025-02-07 23:48:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:24,988 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1940 transitions. [2025-02-07 23:48:24,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-07 23:48:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1940 transitions. [2025-02-07 23:48:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-07 23:48:24,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:24,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 23:48:24,989 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:24,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1250468557, now seen corresponding path program 1 times [2025-02-07 23:48:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:24,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552729037] [2025-02-07 23:48:24,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:25,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-07 23:48:25,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-07 23:48:25,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:25,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:25,376 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-07 23:48:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552729037] [2025-02-07 23:48:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552729037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:25,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:25,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:25,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897818569] [2025-02-07 23:48:25,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:25,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:25,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:25,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:25,378 INFO L87 Difference]: Start difference. First operand 1314 states and 1940 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-07 23:48:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:25,941 INFO L93 Difference]: Finished difference Result 2529 states and 3736 transitions. [2025-02-07 23:48:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:25,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-07 23:48:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:25,943 INFO L225 Difference]: With dead ends: 2529 [2025-02-07 23:48:25,943 INFO L226 Difference]: Without dead ends: 1356 [2025-02-07 23:48:25,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:25,944 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2064 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:25,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 6021 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-02-07 23:48:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1316. [2025-02-07 23:48:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 1.4768060836501902) internal successors, (1942), 1315 states have internal predecessors, (1942), 0 states have call successors, (0), 0 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-07 23:48:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1942 transitions. [2025-02-07 23:48:25,953 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1942 transitions. Word has length 150 [2025-02-07 23:48:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:25,953 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1942 transitions. [2025-02-07 23:48:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-07 23:48:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1942 transitions. [2025-02-07 23:48:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-07 23:48:25,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:25,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 23:48:25,954 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1560617200, now seen corresponding path program 1 times [2025-02-07 23:48:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134731563] [2025-02-07 23:48:25,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:25,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-07 23:48:26,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-07 23:48:26,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:26,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:26,217 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-07 23:48:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:26,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134731563] [2025-02-07 23:48:26,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134731563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:26,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918061237] [2025-02-07 23:48:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:26,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:26,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:26,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:26,218 INFO L87 Difference]: Start difference. First operand 1316 states and 1942 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-07 23:48:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:26,698 INFO L93 Difference]: Finished difference Result 2535 states and 3743 transitions. [2025-02-07 23:48:26,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:26,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-07 23:48:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:26,700 INFO L225 Difference]: With dead ends: 2535 [2025-02-07 23:48:26,700 INFO L226 Difference]: Without dead ends: 1351 [2025-02-07 23:48:26,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:26,702 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2051 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:26,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 4439 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-02-07 23:48:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1313. [2025-02-07 23:48:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 1.4763719512195121) internal successors, (1937), 1312 states have internal predecessors, (1937), 0 states have call successors, (0), 0 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-07 23:48:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1937 transitions. [2025-02-07 23:48:26,712 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1937 transitions. Word has length 150 [2025-02-07 23:48:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:26,712 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1937 transitions. [2025-02-07 23:48:26,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-07 23:48:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1937 transitions. [2025-02-07 23:48:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-07 23:48:26,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:26,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:26,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 23:48:26,713 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:26,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1136828542, now seen corresponding path program 1 times [2025-02-07 23:48:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112826048] [2025-02-07 23:48:26,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:26,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-07 23:48:26,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-07 23:48:26,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:26,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:27,566 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-07 23:48:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112826048] [2025-02-07 23:48:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112826048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-07 23:48:27,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399912690] [2025-02-07 23:48:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:27,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 23:48:27,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:27,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 23:48:27,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-02-07 23:48:27,568 INFO L87 Difference]: Start difference. First operand 1313 states and 1937 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-07 23:48:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:29,589 INFO L93 Difference]: Finished difference Result 2552 states and 3769 transitions. [2025-02-07 23:48:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 23:48:29,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-07 23:48:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:29,592 INFO L225 Difference]: With dead ends: 2552 [2025-02-07 23:48:29,592 INFO L226 Difference]: Without dead ends: 1437 [2025-02-07 23:48:29,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-02-07 23:48:29,593 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 45 mSDsluCounter, 23988 mSDsCounter, 0 mSdLazyCounter, 5753 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25491 SdHoareTripleChecker+Invalid, 5759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:29,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 25491 Invalid, 5759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5753 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-07 23:48:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-02-07 23:48:29,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1422. [2025-02-07 23:48:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 1.4672765657987332) internal successors, (2085), 1421 states have internal predecessors, (2085), 0 states have call successors, (0), 0 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-07 23:48:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2085 transitions. [2025-02-07 23:48:29,609 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2085 transitions. Word has length 151 [2025-02-07 23:48:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:29,609 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2085 transitions. [2025-02-07 23:48:29,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-07 23:48:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2085 transitions. [2025-02-07 23:48:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-07 23:48:29,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:29,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:29,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 23:48:29,610 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:29,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash -570336317, now seen corresponding path program 1 times [2025-02-07 23:48:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:29,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374093525] [2025-02-07 23:48:29,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:29,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:29,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-07 23:48:29,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-07 23:48:29,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:29,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:29,905 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-07 23:48:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:29,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374093525] [2025-02-07 23:48:29,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374093525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:29,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:29,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165763365] [2025-02-07 23:48:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:29,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:29,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:29,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:29,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:29,907 INFO L87 Difference]: Start difference. First operand 1422 states and 2085 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-07 23:48:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:30,456 INFO L93 Difference]: Finished difference Result 2641 states and 3903 transitions. [2025-02-07 23:48:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:30,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-07 23:48:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:30,458 INFO L225 Difference]: With dead ends: 2641 [2025-02-07 23:48:30,458 INFO L226 Difference]: Without dead ends: 1454 [2025-02-07 23:48:30,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:30,459 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2007 mSDsluCounter, 2954 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:30,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 4433 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-02-07 23:48:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1416. [2025-02-07 23:48:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.4664310954063604) internal successors, (2075), 1415 states have internal predecessors, (2075), 0 states have call successors, (0), 0 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-07 23:48:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2075 transitions. [2025-02-07 23:48:30,469 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2075 transitions. Word has length 151 [2025-02-07 23:48:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:30,469 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2075 transitions. [2025-02-07 23:48:30,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-07 23:48:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2075 transitions. [2025-02-07 23:48:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-07 23:48:30,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:30,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:30,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 23:48:30,471 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:30,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:30,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1431506861, now seen corresponding path program 1 times [2025-02-07 23:48:30,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050633721] [2025-02-07 23:48:30,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:30,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-07 23:48:30,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-07 23:48:30,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:30,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:30,738 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-07 23:48:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050633721] [2025-02-07 23:48:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050633721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640996122] [2025-02-07 23:48:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:30,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:30,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:30,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:30,740 INFO L87 Difference]: Start difference. First operand 1416 states and 2075 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-07 23:48:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:31,216 INFO L93 Difference]: Finished difference Result 2732 states and 4006 transitions. [2025-02-07 23:48:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:31,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-07 23:48:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:31,218 INFO L225 Difference]: With dead ends: 2732 [2025-02-07 23:48:31,221 INFO L226 Difference]: Without dead ends: 1451 [2025-02-07 23:48:31,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:31,223 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2036 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2036 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:31,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2036 Valid, 4439 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:48:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2025-02-07 23:48:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1413. [2025-02-07 23:48:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.4660056657223797) internal successors, (2070), 1412 states have internal predecessors, (2070), 0 states have call successors, (0), 0 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-07 23:48:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2070 transitions. [2025-02-07 23:48:31,235 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2070 transitions. Word has length 151 [2025-02-07 23:48:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2070 transitions. [2025-02-07 23:48:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-07 23:48:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2070 transitions. [2025-02-07 23:48:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-07 23:48:31,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:31,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:31,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 23:48:31,235 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash 553334987, now seen corresponding path program 1 times [2025-02-07 23:48:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465163380] [2025-02-07 23:48:31,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:31,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-07 23:48:31,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-07 23:48:31,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:31,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:31,540 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-07 23:48:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465163380] [2025-02-07 23:48:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465163380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:31,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:31,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938371767] [2025-02-07 23:48:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:31,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:31,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:31,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:31,542 INFO L87 Difference]: Start difference. First operand 1413 states and 2070 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:32,102 INFO L93 Difference]: Finished difference Result 2675 states and 3936 transitions. [2025-02-07 23:48:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-07 23:48:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:32,104 INFO L225 Difference]: With dead ends: 2675 [2025-02-07 23:48:32,104 INFO L226 Difference]: Without dead ends: 1447 [2025-02-07 23:48:32,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:32,106 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 2029 mSDsluCounter, 2958 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:32,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 4439 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-02-07 23:48:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1409. [2025-02-07 23:48:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4651988636363635) internal successors, (2063), 1408 states have internal predecessors, (2063), 0 states have call successors, (0), 0 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-07 23:48:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2063 transitions. [2025-02-07 23:48:32,116 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2063 transitions. Word has length 152 [2025-02-07 23:48:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:32,116 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 2063 transitions. [2025-02-07 23:48:32,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2063 transitions. [2025-02-07 23:48:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-07 23:48:32,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:32,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:32,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 23:48:32,117 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:32,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1633798025, now seen corresponding path program 1 times [2025-02-07 23:48:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268799067] [2025-02-07 23:48:32,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:32,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:32,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-07 23:48:32,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-07 23:48:32,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:32,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:32,417 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-07 23:48:32,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268799067] [2025-02-07 23:48:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268799067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:32,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:32,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057956348] [2025-02-07 23:48:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:32,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:48:32,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:32,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:48:32,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:32,418 INFO L87 Difference]: Start difference. First operand 1409 states and 2063 transitions. Second operand has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:33,287 INFO L93 Difference]: Finished difference Result 2678 states and 3940 transitions. [2025-02-07 23:48:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:48:33,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-07 23:48:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:33,289 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 23:48:33,289 INFO L226 Difference]: Without dead ends: 1506 [2025-02-07 23:48:33,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:33,291 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 38 mSDsluCounter, 9286 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 10849 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:33,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 10849 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:48:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-07 23:48:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1409. [2025-02-07 23:48:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4651988636363635) internal successors, (2063), 1408 states have internal predecessors, (2063), 0 states have call successors, (0), 0 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-07 23:48:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2063 transitions. [2025-02-07 23:48:33,304 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2063 transitions. Word has length 152 [2025-02-07 23:48:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:33,305 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 2063 transitions. [2025-02-07 23:48:33,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2063 transitions. [2025-02-07 23:48:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-07 23:48:33,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:33,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:33,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 23:48:33,306 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:33,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1496236301, now seen corresponding path program 1 times [2025-02-07 23:48:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:33,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186404377] [2025-02-07 23:48:33,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:33,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-07 23:48:33,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-07 23:48:33,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:33,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:33,682 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-07 23:48:33,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:33,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186404377] [2025-02-07 23:48:33,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186404377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:33,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:33,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961305131] [2025-02-07 23:48:33,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:33,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:48:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:33,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:48:33,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:33,683 INFO L87 Difference]: Start difference. First operand 1409 states and 2063 transitions. Second operand has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:34,336 INFO L93 Difference]: Finished difference Result 2609 states and 3853 transitions. [2025-02-07 23:48:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:48:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-07 23:48:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:34,338 INFO L225 Difference]: With dead ends: 2609 [2025-02-07 23:48:34,338 INFO L226 Difference]: Without dead ends: 1449 [2025-02-07 23:48:34,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:34,339 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 22 mSDsluCounter, 6037 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7539 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:34,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7539 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:48:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-02-07 23:48:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1445. [2025-02-07 23:48:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.4626038781163435) internal successors, (2112), 1444 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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-07 23:48:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2112 transitions. [2025-02-07 23:48:34,348 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2112 transitions. Word has length 152 [2025-02-07 23:48:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2112 transitions. [2025-02-07 23:48:34,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2112 transitions. [2025-02-07 23:48:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-07 23:48:34,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:34,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:34,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 23:48:34,349 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:34,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -632974695, now seen corresponding path program 1 times [2025-02-07 23:48:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585885017] [2025-02-07 23:48:34,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:34,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-07 23:48:34,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-07 23:48:34,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:34,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:48:34,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:34,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585885017] [2025-02-07 23:48:34,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585885017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:34,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:34,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940937111] [2025-02-07 23:48:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:34,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:48:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:34,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:48:34,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:48:34,816 INFO L87 Difference]: Start difference. First operand 1445 states and 2112 transitions. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:35,563 INFO L93 Difference]: Finished difference Result 2800 states and 4094 transitions. [2025-02-07 23:48:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:48:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-07 23:48:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:35,565 INFO L225 Difference]: With dead ends: 2800 [2025-02-07 23:48:35,565 INFO L226 Difference]: Without dead ends: 1497 [2025-02-07 23:48:35,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:48:35,566 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 2026 mSDsluCounter, 4725 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 6200 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:35,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2026 Valid, 6200 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:48:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-02-07 23:48:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1445. [2025-02-07 23:48:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.4619113573407203) internal successors, (2111), 1444 states have internal predecessors, (2111), 0 states have call successors, (0), 0 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-07 23:48:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2111 transitions. [2025-02-07 23:48:35,576 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2111 transitions. Word has length 152 [2025-02-07 23:48:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:35,576 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2111 transitions. [2025-02-07 23:48:35,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-07 23:48:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2111 transitions. [2025-02-07 23:48:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-07 23:48:35,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:35,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:35,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 23:48:35,576 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:35,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1975555945, now seen corresponding path program 1 times [2025-02-07 23:48:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:35,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62592768] [2025-02-07 23:48:35,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:35,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-07 23:48:35,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-07 23:48:35,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:35,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:35,987 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-07 23:48:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62592768] [2025-02-07 23:48:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62592768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:35,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:35,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:35,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062105725] [2025-02-07 23:48:35,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:35,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:35,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:35,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:35,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:35,989 INFO L87 Difference]: Start difference. First operand 1445 states and 2111 transitions. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-07 23:48:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:36,757 INFO L93 Difference]: Finished difference Result 2798 states and 4090 transitions. [2025-02-07 23:48:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:36,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-07 23:48:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:36,758 INFO L225 Difference]: With dead ends: 2798 [2025-02-07 23:48:36,758 INFO L226 Difference]: Without dead ends: 1498 [2025-02-07 23:48:36,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:36,760 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2028 mSDsluCounter, 5906 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 7385 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:36,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2028 Valid, 7385 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:48:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-02-07 23:48:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1446. [2025-02-07 23:48:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1445 states have (on average 1.4608996539792387) internal successors, (2111), 1445 states have internal predecessors, (2111), 0 states have call successors, (0), 0 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-07 23:48:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2111 transitions. [2025-02-07 23:48:36,771 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2111 transitions. Word has length 153 [2025-02-07 23:48:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:36,772 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2111 transitions. [2025-02-07 23:48:36,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-07 23:48:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2111 transitions. [2025-02-07 23:48:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-07 23:48:36,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:36,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:36,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 23:48:36,773 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:36,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash -653496558, now seen corresponding path program 1 times [2025-02-07 23:48:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512930956] [2025-02-07 23:48:36,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-07 23:48:36,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-07 23:48:36,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:36,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:37,129 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-07 23:48:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512930956] [2025-02-07 23:48:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512930956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:37,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:37,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:37,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251671959] [2025-02-07 23:48:37,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:37,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:37,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:37,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:37,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:37,130 INFO L87 Difference]: Start difference. First operand 1446 states and 2111 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-07 23:48:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:37,678 INFO L93 Difference]: Finished difference Result 2755 states and 4040 transitions. [2025-02-07 23:48:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:37,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-07 23:48:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:37,679 INFO L225 Difference]: With dead ends: 2755 [2025-02-07 23:48:37,679 INFO L226 Difference]: Without dead ends: 1451 [2025-02-07 23:48:37,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:37,680 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 2014 mSDsluCounter, 2954 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2014 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:37,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2014 Valid, 4433 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:48:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2025-02-07 23:48:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1399. [2025-02-07 23:48:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1398 states have (on average 1.4706723891273248) internal successors, (2056), 1398 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:48:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2056 transitions. [2025-02-07 23:48:37,689 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2056 transitions. Word has length 153 [2025-02-07 23:48:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:37,690 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 2056 transitions. [2025-02-07 23:48:37,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-07 23:48:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2056 transitions. [2025-02-07 23:48:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-07 23:48:37,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:37,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, 1, 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-07 23:48:37,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 23:48:37,691 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1148248606, now seen corresponding path program 1 times [2025-02-07 23:48:37,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:37,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26297164] [2025-02-07 23:48:37,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:37,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-07 23:48:37,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 23:48:37,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:37,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:38,018 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-07 23:48:38,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:38,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26297164] [2025-02-07 23:48:38,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26297164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:38,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:38,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:38,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872758385] [2025-02-07 23:48:38,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:38,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:48:38,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:38,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:48:38,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:48:38,020 INFO L87 Difference]: Start difference. First operand 1399 states and 2056 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-07 23:48:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:38,458 INFO L93 Difference]: Finished difference Result 2661 states and 3932 transitions. [2025-02-07 23:48:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:48:38,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-07 23:48:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:38,460 INFO L225 Difference]: With dead ends: 2661 [2025-02-07 23:48:38,460 INFO L226 Difference]: Without dead ends: 1448 [2025-02-07 23:48:38,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:38,461 INFO L435 NwaCegarLoop]: 1480 mSDtfsCounter, 1974 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:38,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 4436 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:48:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2025-02-07 23:48:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1396. [2025-02-07 23:48:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1395 states have (on average 1.4702508960573477) internal successors, (2051), 1395 states have internal predecessors, (2051), 0 states have call successors, (0), 0 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-07 23:48:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2051 transitions. [2025-02-07 23:48:38,470 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2051 transitions. Word has length 154 [2025-02-07 23:48:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:38,470 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2051 transitions. [2025-02-07 23:48:38,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-07 23:48:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2051 transitions. [2025-02-07 23:48:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-07 23:48:38,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:38,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:38,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 23:48:38,471 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:38,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash 69055789, now seen corresponding path program 1 times [2025-02-07 23:48:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:38,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729208898] [2025-02-07 23:48:38,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:38,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:38,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-07 23:48:38,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-07 23:48:38,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:38,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:38,823 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-07 23:48:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:38,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729208898] [2025-02-07 23:48:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729208898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:38,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:38,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526761972] [2025-02-07 23:48:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:38,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:48:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:38,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:48:38,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:38,825 INFO L87 Difference]: Start difference. First operand 1396 states and 2051 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-07 23:48:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:39,594 INFO L93 Difference]: Finished difference Result 2609 states and 3862 transitions. [2025-02-07 23:48:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:48:39,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-02-07 23:48:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:39,596 INFO L225 Difference]: With dead ends: 2609 [2025-02-07 23:48:39,596 INFO L226 Difference]: Without dead ends: 1425 [2025-02-07 23:48:39,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:39,597 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 26 mSDsluCounter, 8990 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10491 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:39,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10491 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:48:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-02-07 23:48:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1421. [2025-02-07 23:48:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.4697183098591549) internal successors, (2087), 1420 states have internal predecessors, (2087), 0 states have call successors, (0), 0 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-07 23:48:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2087 transitions. [2025-02-07 23:48:39,618 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2087 transitions. Word has length 155 [2025-02-07 23:48:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:39,618 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 2087 transitions. [2025-02-07 23:48:39,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-07 23:48:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2087 transitions. [2025-02-07 23:48:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-07 23:48:39,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:39,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:39,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 23:48:39,623 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:39,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:39,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1565008102, now seen corresponding path program 1 times [2025-02-07 23:48:39,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:39,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883099448] [2025-02-07 23:48:39,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:39,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-07 23:48:39,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-07 23:48:39,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:39,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:40,653 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-07 23:48:40,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:40,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883099448] [2025-02-07 23:48:40,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883099448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:40,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:40,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-02-07 23:48:40,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300662989] [2025-02-07 23:48:40,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:40,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 23:48:40,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:40,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 23:48:40,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2025-02-07 23:48:40,655 INFO L87 Difference]: Start difference. First operand 1421 states and 2087 transitions. Second operand has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 26 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-07 23:48:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:43,544 INFO L93 Difference]: Finished difference Result 2812 states and 4159 transitions. [2025-02-07 23:48:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-07 23:48:43,545 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 26 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-02-07 23:48:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:43,546 INFO L225 Difference]: With dead ends: 2812 [2025-02-07 23:48:43,546 INFO L226 Difference]: Without dead ends: 1603 [2025-02-07 23:48:43,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-02-07 23:48:43,548 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 1896 mSDsluCounter, 35775 mSDsCounter, 0 mSdLazyCounter, 9164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 37269 SdHoareTripleChecker+Invalid, 9173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:43,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 37269 Invalid, 9173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9164 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-07 23:48:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-02-07 23:48:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1593. [2025-02-07 23:48:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1592 states have (on average 1.4717336683417086) internal successors, (2343), 1592 states have internal predecessors, (2343), 0 states have call successors, (0), 0 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-07 23:48:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2343 transitions. [2025-02-07 23:48:43,571 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2343 transitions. Word has length 155 [2025-02-07 23:48:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2343 transitions. [2025-02-07 23:48:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 26 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-07 23:48:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2343 transitions. [2025-02-07 23:48:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-07 23:48:43,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:43,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 23:48:43,572 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:43,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 960952952, now seen corresponding path program 1 times [2025-02-07 23:48:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313193039] [2025-02-07 23:48:43,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:43,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-07 23:48:43,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-07 23:48:43,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:43,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:44,206 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-07 23:48:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313193039] [2025-02-07 23:48:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313193039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:44,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:44,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924025756] [2025-02-07 23:48:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:44,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:44,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:44,208 INFO L87 Difference]: Start difference. First operand 1593 states and 2343 transitions. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-07 23:48:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:45,027 INFO L93 Difference]: Finished difference Result 3919 states and 5812 transitions. [2025-02-07 23:48:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-02-07 23:48:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:45,029 INFO L225 Difference]: With dead ends: 3919 [2025-02-07 23:48:45,030 INFO L226 Difference]: Without dead ends: 2538 [2025-02-07 23:48:45,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:48:45,031 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 4459 mSDsluCounter, 5897 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4459 SdHoareTripleChecker+Valid, 7373 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:45,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4459 Valid, 7373 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 23:48:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2025-02-07 23:48:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 1636. [2025-02-07 23:48:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 1.4685015290519878) internal successors, (2401), 1635 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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-07 23:48:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2401 transitions. [2025-02-07 23:48:45,043 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2401 transitions. Word has length 155 [2025-02-07 23:48:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:45,043 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2401 transitions. [2025-02-07 23:48:45,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 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-07 23:48:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2401 transitions. [2025-02-07 23:48:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-07 23:48:45,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:45,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:45,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 23:48:45,044 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:45,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash 660199415, now seen corresponding path program 1 times [2025-02-07 23:48:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:45,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672769368] [2025-02-07 23:48:45,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:45,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-07 23:48:45,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-07 23:48:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:45,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:45,591 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-07 23:48:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672769368] [2025-02-07 23:48:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672769368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:45,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:48:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691470670] [2025-02-07 23:48:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:48:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:45,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:48:45,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:48:45,595 INFO L87 Difference]: Start difference. First operand 1636 states and 2401 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-07 23:48:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:46,569 INFO L93 Difference]: Finished difference Result 3933 states and 5828 transitions. [2025-02-07 23:48:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:48:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-02-07 23:48:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:46,572 INFO L225 Difference]: With dead ends: 3933 [2025-02-07 23:48:46,572 INFO L226 Difference]: Without dead ends: 2552 [2025-02-07 23:48:46,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:48:46,573 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 4537 mSDsluCounter, 7878 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4537 SdHoareTripleChecker+Valid, 9351 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:46,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4537 Valid, 9351 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:48:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-02-07 23:48:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1656. [2025-02-07 23:48:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.4676737160120845) internal successors, (2429), 1655 states have internal predecessors, (2429), 0 states have call successors, (0), 0 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-07 23:48:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2429 transitions. [2025-02-07 23:48:46,601 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2429 transitions. Word has length 156 [2025-02-07 23:48:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:46,601 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2429 transitions. [2025-02-07 23:48:46,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 8 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-07 23:48:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2429 transitions. [2025-02-07 23:48:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-07 23:48:46,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:46,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:46,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 23:48:46,602 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:46,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1837715934, now seen corresponding path program 1 times [2025-02-07 23:48:46,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:46,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337254429] [2025-02-07 23:48:46,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:46,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-07 23:48:46,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-07 23:48:46,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:46,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:46,933 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-07 23:48:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:46,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337254429] [2025-02-07 23:48:46,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337254429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:46,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:46,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:48:46,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524255573] [2025-02-07 23:48:46,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:46,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:48:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:46,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:48:46,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:48:46,934 INFO L87 Difference]: Start difference. First operand 1656 states and 2429 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-07 23:48:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:47,690 INFO L93 Difference]: Finished difference Result 3939 states and 5832 transitions. [2025-02-07 23:48:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:48:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-02-07 23:48:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:47,693 INFO L225 Difference]: With dead ends: 3939 [2025-02-07 23:48:47,693 INFO L226 Difference]: Without dead ends: 2552 [2025-02-07 23:48:47,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:47,694 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 4519 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4519 SdHoareTripleChecker+Valid, 7369 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:47,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4519 Valid, 7369 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:48:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-02-07 23:48:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1668. [2025-02-07 23:48:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.4631073785242952) internal successors, (2439), 1667 states have internal predecessors, (2439), 0 states have call successors, (0), 0 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-07 23:48:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2439 transitions. [2025-02-07 23:48:47,710 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2439 transitions. Word has length 157 [2025-02-07 23:48:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:47,711 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2439 transitions. [2025-02-07 23:48:47,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-07 23:48:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2439 transitions. [2025-02-07 23:48:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-07 23:48:47,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:47,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:47,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 23:48:47,712 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1939081244, now seen corresponding path program 1 times [2025-02-07 23:48:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131987532] [2025-02-07 23:48:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:47,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-07 23:48:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-07 23:48:47,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:47,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:48,164 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-07 23:48:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:48,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131987532] [2025-02-07 23:48:48,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131987532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:48,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:48:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004604183] [2025-02-07 23:48:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:48,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:48:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:48,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:48:48,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:48:48,167 INFO L87 Difference]: Start difference. First operand 1668 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-07 23:48:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:48,493 INFO L93 Difference]: Finished difference Result 3057 states and 4507 transitions. [2025-02-07 23:48:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:48:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-02-07 23:48:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:48,495 INFO L225 Difference]: With dead ends: 3057 [2025-02-07 23:48:48,495 INFO L226 Difference]: Without dead ends: 1642 [2025-02-07 23:48:48,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:48:48,496 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 0 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:48,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3011 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:48:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2025-02-07 23:48:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2025-02-07 23:48:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1641 states have (on average 1.4631322364411945) internal successors, (2401), 1641 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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-07 23:48:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2401 transitions. [2025-02-07 23:48:48,506 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2401 transitions. Word has length 157 [2025-02-07 23:48:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:48,506 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2401 transitions. [2025-02-07 23:48:48,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 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-07 23:48:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2401 transitions. [2025-02-07 23:48:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-07 23:48:48,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:48,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:48,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 23:48:48,507 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:48,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1571973828, now seen corresponding path program 1 times [2025-02-07 23:48:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376969147] [2025-02-07 23:48:48,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:48,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-07 23:48:48,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-07 23:48:48,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:48,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:48:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376969147] [2025-02-07 23:48:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376969147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:48:49,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530638467] [2025-02-07 23:48:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:49,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:48:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:49,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:48:49,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:48:49,043 INFO L87 Difference]: Start difference. First operand 1642 states and 2401 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-07 23:48:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:49,763 INFO L93 Difference]: Finished difference Result 3029 states and 4467 transitions. [2025-02-07 23:48:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:48:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-02-07 23:48:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:49,765 INFO L225 Difference]: With dead ends: 3029 [2025-02-07 23:48:49,765 INFO L226 Difference]: Without dead ends: 1652 [2025-02-07 23:48:49,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:48:49,766 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 1803 mSDsluCounter, 7381 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 8859 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:49,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 8859 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:48:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-02-07 23:48:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1646. [2025-02-07 23:48:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1645 states have (on average 1.4620060790273557) internal successors, (2405), 1645 states have internal predecessors, (2405), 0 states have call successors, (0), 0 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-07 23:48:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2405 transitions. [2025-02-07 23:48:49,780 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2405 transitions. Word has length 158 [2025-02-07 23:48:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:49,780 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 2405 transitions. [2025-02-07 23:48:49,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 7 states have internal predecessors, (158), 0 states have call successors, (0), 0 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-07 23:48:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2405 transitions. [2025-02-07 23:48:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-07 23:48:49,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:49,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:49,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 23:48:49,781 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:49,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1981218626, now seen corresponding path program 1 times [2025-02-07 23:48:49,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:49,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483022045] [2025-02-07 23:48:49,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:49,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-07 23:48:49,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-07 23:48:49,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:49,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:50,366 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-07 23:48:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483022045] [2025-02-07 23:48:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483022045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:50,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 23:48:50,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011539447] [2025-02-07 23:48:50,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:50,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 23:48:50,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:50,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 23:48:50,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:48:50,367 INFO L87 Difference]: Start difference. First operand 1646 states and 2405 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-07 23:48:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:51,553 INFO L93 Difference]: Finished difference Result 3053 states and 4501 transitions. [2025-02-07 23:48:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:48:51,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-07 23:48:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:51,554 INFO L225 Difference]: With dead ends: 3053 [2025-02-07 23:48:51,554 INFO L226 Difference]: Without dead ends: 1676 [2025-02-07 23:48:51,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:48:51,555 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 66 mSDsluCounter, 11926 mSDsCounter, 0 mSdLazyCounter, 2815 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 13423 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:51,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 13423 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2815 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 23:48:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-02-07 23:48:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1654. [2025-02-07 23:48:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 1.4597701149425288) internal successors, (2413), 1653 states have internal predecessors, (2413), 0 states have call successors, (0), 0 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-07 23:48:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2413 transitions. [2025-02-07 23:48:51,567 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2413 transitions. Word has length 159 [2025-02-07 23:48:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:51,567 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2413 transitions. [2025-02-07 23:48:51,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-07 23:48:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2413 transitions. [2025-02-07 23:48:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-07 23:48:51,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:51,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:51,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 23:48:51,568 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -256017891, now seen corresponding path program 1 times [2025-02-07 23:48:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458741050] [2025-02-07 23:48:51,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:51,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-07 23:48:51,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-07 23:48:51,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:51,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:52,459 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-07 23:48:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458741050] [2025-02-07 23:48:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458741050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:52,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:52,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:48:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146785897] [2025-02-07 23:48:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:52,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:48:52,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:52,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:48:52,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:48:52,461 INFO L87 Difference]: Start difference. First operand 1654 states and 2413 transitions. Second operand has 12 states, 12 states have (on average 13.333333333333334) internal successors, (160), 12 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-07 23:48:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:53,935 INFO L93 Difference]: Finished difference Result 3099 states and 4565 transitions. [2025-02-07 23:48:53,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:48:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.333333333333334) internal successors, (160), 12 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-07 23:48:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:53,937 INFO L225 Difference]: With dead ends: 3099 [2025-02-07 23:48:53,937 INFO L226 Difference]: Without dead ends: 1714 [2025-02-07 23:48:53,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:48:53,938 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 4 mSDsluCounter, 14922 mSDsCounter, 0 mSdLazyCounter, 3564 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 16418 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:53,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 16418 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3564 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 23:48:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-02-07 23:48:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1702. [2025-02-07 23:48:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.4632569077013522) internal successors, (2489), 1701 states have internal predecessors, (2489), 0 states have call successors, (0), 0 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-07 23:48:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2489 transitions. [2025-02-07 23:48:53,948 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2489 transitions. Word has length 160 [2025-02-07 23:48:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:53,948 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2489 transitions. [2025-02-07 23:48:53,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.333333333333334) internal successors, (160), 12 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-07 23:48:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2489 transitions. [2025-02-07 23:48:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-07 23:48:53,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:53,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:53,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 23:48:53,950 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:53,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash 210757889, now seen corresponding path program 1 times [2025-02-07 23:48:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250119285] [2025-02-07 23:48:53,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-07 23:48:54,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-07 23:48:54,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:54,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:54,150 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-07 23:48:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250119285] [2025-02-07 23:48:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250119285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:54,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:54,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:48:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512557588] [2025-02-07 23:48:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:54,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 23:48:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:54,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 23:48:54,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:48:54,152 INFO L87 Difference]: Start difference. First operand 1702 states and 2489 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-07 23:48:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:54,416 INFO L93 Difference]: Finished difference Result 3135 states and 4625 transitions. [2025-02-07 23:48:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 23:48:54,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-07 23:48:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:54,417 INFO L225 Difference]: With dead ends: 3135 [2025-02-07 23:48:54,417 INFO L226 Difference]: Without dead ends: 1702 [2025-02-07 23:48:54,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:48:54,419 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:54,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3009 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:48:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-02-07 23:48:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1681. [2025-02-07 23:48:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 1.4678571428571427) internal successors, (2466), 1680 states have internal predecessors, (2466), 0 states have call successors, (0), 0 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-07 23:48:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 2466 transitions. [2025-02-07 23:48:54,428 INFO L78 Accepts]: Start accepts. Automaton has 1681 states and 2466 transitions. Word has length 160 [2025-02-07 23:48:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:54,428 INFO L471 AbstractCegarLoop]: Abstraction has 1681 states and 2466 transitions. [2025-02-07 23:48:54,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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-07 23:48:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2466 transitions. [2025-02-07 23:48:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-07 23:48:54,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:54,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:54,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 23:48:54,429 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1359054238, now seen corresponding path program 1 times [2025-02-07 23:48:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104051986] [2025-02-07 23:48:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:54,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-07 23:48:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-07 23:48:54,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:55,403 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-07 23:48:55,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:55,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104051986] [2025-02-07 23:48:55,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104051986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:55,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:55,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-07 23:48:55,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965405899] [2025-02-07 23:48:55,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:55,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 23:48:55,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:55,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 23:48:55,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2025-02-07 23:48:55,405 INFO L87 Difference]: Start difference. First operand 1681 states and 2466 transitions. Second operand has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-07 23:48:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:48:57,764 INFO L93 Difference]: Finished difference Result 3133 states and 4623 transitions. [2025-02-07 23:48:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 23:48:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-07 23:48:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:48:57,766 INFO L225 Difference]: With dead ends: 3133 [2025-02-07 23:48:57,766 INFO L226 Difference]: Without dead ends: 1695 [2025-02-07 23:48:57,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2025-02-07 23:48:57,767 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 66 mSDsluCounter, 31406 mSDsCounter, 0 mSdLazyCounter, 7887 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 32905 SdHoareTripleChecker+Invalid, 7889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:48:57,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 32905 Invalid, 7889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7887 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 23:48:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-02-07 23:48:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1687. [2025-02-07 23:48:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1686 states have (on average 1.4673784104389087) internal successors, (2474), 1686 states have internal predecessors, (2474), 0 states have call successors, (0), 0 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-07 23:48:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2474 transitions. [2025-02-07 23:48:57,778 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2474 transitions. Word has length 161 [2025-02-07 23:48:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:48:57,778 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2474 transitions. [2025-02-07 23:48:57,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-07 23:48:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2474 transitions. [2025-02-07 23:48:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-07 23:48:57,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:48:57,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:48:57,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 23:48:57,779 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:48:57,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:48:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash -791255383, now seen corresponding path program 1 times [2025-02-07 23:48:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:48:57,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146329088] [2025-02-07 23:48:57,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:48:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:48:57,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-07 23:48:57,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-07 23:48:57,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:48:57,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:48:59,567 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-07 23:48:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:48:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146329088] [2025-02-07 23:48:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146329088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:48:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:48:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2025-02-07 23:48:59,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849884206] [2025-02-07 23:48:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:48:59,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 23:48:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:48:59,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 23:48:59,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 23:48:59,570 INFO L87 Difference]: Start difference. First operand 1687 states and 2474 transitions. Second operand has 34 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-07 23:49:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:49:04,325 INFO L93 Difference]: Finished difference Result 3183 states and 4695 transitions. [2025-02-07 23:49:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-07 23:49:04,325 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-07 23:49:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:49:04,326 INFO L225 Difference]: With dead ends: 3183 [2025-02-07 23:49:04,326 INFO L226 Difference]: Without dead ends: 1709 [2025-02-07 23:49:04,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 23:49:04,328 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 29 mSDsluCounter, 45806 mSDsCounter, 0 mSdLazyCounter, 12050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 47287 SdHoareTripleChecker+Invalid, 12050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:49:04,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 47287 Invalid, 12050 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 12050 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-07 23:49:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-02-07 23:49:04,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1697. [2025-02-07 23:49:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1696 states have (on average 1.4699292452830188) internal successors, (2493), 1696 states have internal predecessors, (2493), 0 states have call successors, (0), 0 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-07 23:49:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2493 transitions. [2025-02-07 23:49:04,337 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2493 transitions. Word has length 161 [2025-02-07 23:49:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:49:04,337 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2493 transitions. [2025-02-07 23:49:04,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.735294117647059) internal successors, (161), 34 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-07 23:49:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2493 transitions. [2025-02-07 23:49:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-07 23:49:04,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:49:04,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:49:04,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 23:49:04,338 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:49:04,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:49:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash -352016552, now seen corresponding path program 1 times [2025-02-07 23:49:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:49:04,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347830187] [2025-02-07 23:49:04,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:49:04,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:49:04,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-07 23:49:04,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-07 23:49:04,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:49:04,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:49:04,472 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:49:04,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-07 23:49:04,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-07 23:49:04,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:49:04,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:49:04,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:49:04,659 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:49:04,659 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:49:04,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 23:49:04,662 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:49:04,713 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:49:04,733 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:49:04,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:49:04 BoogieIcfgContainer [2025-02-07 23:49:04,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:49:04,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:49:04,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:49:04,736 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:49:04,737 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:47:49" (3/4) ... [2025-02-07 23:49:04,738 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:49:04,739 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:49:04,739 INFO L158 Benchmark]: Toolchain (without parser) took 81175.74ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.5MB in the beginning and 1.0GB in the end (delta: -909.2MB). Peak memory consumption was 431.5MB. Max. memory is 16.1GB. [2025-02-07 23:49:04,740 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:49:04,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.64ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 65.9MB in the end (delta: 36.5MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. [2025-02-07 23:49:04,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 494.55ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 65.9MB in the beginning and 204.5MB in the end (delta: -138.6MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2025-02-07 23:49:04,741 INFO L158 Benchmark]: Boogie Preprocessor took 524.55ms. Allocated memory is still 335.5MB. Free memory was 204.5MB in the beginning and 182.4MB in the end (delta: 22.1MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2025-02-07 23:49:04,741 INFO L158 Benchmark]: IcfgBuilder took 4026.45ms. Allocated memory was 335.5MB in the beginning and 612.4MB in the end (delta: 276.8MB). Free memory was 182.4MB in the beginning and 205.7MB in the end (delta: -23.2MB). Peak memory consumption was 275.5MB. Max. memory is 16.1GB. [2025-02-07 23:49:04,741 INFO L158 Benchmark]: TraceAbstraction took 75499.06ms. Allocated memory was 612.4MB in the beginning and 1.5GB in the end (delta: 864.0MB). Free memory was 205.7MB in the beginning and 1.0GB in the end (delta: -806.1MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2025-02-07 23:49:04,741 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 1.5GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 130.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:49:04,741 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.12ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.64ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 65.9MB in the end (delta: 36.5MB). Peak memory consumption was 97.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 494.55ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 65.9MB in the beginning and 204.5MB in the end (delta: -138.6MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 524.55ms. Allocated memory is still 335.5MB. Free memory was 204.5MB in the beginning and 182.4MB in the end (delta: 22.1MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * IcfgBuilder took 4026.45ms. Allocated memory was 335.5MB in the beginning and 612.4MB in the end (delta: 276.8MB). Free memory was 182.4MB in the beginning and 205.7MB in the end (delta: -23.2MB). Peak memory consumption was 275.5MB. Max. memory is 16.1GB. * TraceAbstraction took 75499.06ms. Allocated memory was 612.4MB in the beginning and 1.5GB in the end (delta: 864.0MB). Free memory was 205.7MB in the beginning and 1.0GB in the end (delta: -806.1MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 1.5GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 130.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 531, overapproximation of bitwiseAnd at line 490, overapproximation of bitwiseAnd at line 539. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_32 = 8; [L48] const SORT_21 var_35 = 16; [L49] const SORT_21 var_38 = 32; [L50] const SORT_21 var_41 = 64; [L51] const SORT_21 var_44 = 0; [L52] const SORT_3 var_101 = 1; [L53] const SORT_3 var_105 = 0; [L54] const SORT_6 var_190 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_412; [L72] SORT_3 input_434; [L73] SORT_3 input_449; [L74] SORT_3 input_464; [L75] SORT_3 input_479; [L76] SORT_3 input_494; [L77] SORT_3 input_509; [L78] SORT_3 input_524; [L79] SORT_3 input_539; [L80] SORT_3 input_554; [L81] SORT_3 input_569; [L82] SORT_3 input_584; [L83] SORT_3 input_599; [L84] SORT_3 input_614; [L85] SORT_3 input_629; [L86] SORT_3 input_644; [L87] SORT_3 input_660; [L88] SORT_3 input_662; [L89] SORT_3 input_664; [L90] SORT_3 input_666; [L91] SORT_3 input_668; [L92] SORT_3 input_670; [L93] SORT_3 input_672; [L94] SORT_3 input_674; [L95] SORT_3 input_679; [L96] SORT_21 input_724; [L97] SORT_21 input_725; [L98] SORT_21 input_726; [L99] SORT_21 input_727; [L100] SORT_21 input_730; [L101] SORT_21 input_734; [L102] SORT_21 input_738; [L103] SORT_21 input_746; [L104] SORT_21 input_750; [L105] SORT_21 input_752; [L106] SORT_21 input_756; [L107] SORT_21 input_759; [L108] SORT_21 input_763; [L109] SORT_21 input_768; [L110] SORT_21 input_772; [L111] SORT_21 input_777; [L112] SORT_21 input_779; [L113] SORT_21 input_780; [L114] SORT_21 input_782; [L115] SORT_21 input_786; [L116] SORT_21 input_791; [L117] SORT_21 input_798; [L118] SORT_21 input_799; [L119] SORT_21 input_801; [L120] SORT_21 input_805; [L121] SORT_21 input_810; [L122] SORT_21 input_812; [L123] SORT_21 input_813; [L124] SORT_21 input_815; [L125] SORT_21 input_819; [L126] SORT_21 input_824; [L127] SORT_21 input_828; [L128] SORT_21 input_833; [L129] SORT_21 input_835; [L130] SORT_21 input_841; [L131] SORT_21 input_853; [L132] SORT_3 input_858; [L133] SORT_3 input_867; [L134] SORT_3 input_886; [L135] SORT_3 input_893; [L136] SORT_3 input_904; [L137] SORT_3 input_910; [L138] SORT_3 input_916; [L139] SORT_3 input_922; [L140] SORT_3 input_928; [L141] SORT_3 input_934; [L142] SORT_3 input_940; [L143] SORT_3 input_946; [L144] SORT_3 input_952; [L145] SORT_3 input_958; [L146] SORT_3 input_964; [L147] SORT_3 input_970; [L148] SORT_3 input_976; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L151] SORT_21 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L152] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L153] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L154] SORT_3 state_110 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L155] SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L156] SORT_3 state_118 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L157] SORT_3 state_122 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L158] SORT_3 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L159] SORT_3 state_155 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L160] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L161] SORT_3 state_160 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L162] SORT_3 state_164 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L163] SORT_3 state_168 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L164] SORT_3 state_173 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L165] SORT_3 state_176 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L166] SORT_3 state_186 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L167] SORT_3 state_193 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L168] SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L169] SORT_3 state_205 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L170] SORT_3 state_210 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L171] SORT_3 state_213 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L172] SORT_3 state_225 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L173] SORT_3 state_235 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L174] SORT_3 state_240 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L175] SORT_3 state_243 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L176] SORT_3 state_252 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L177] SORT_3 state_265 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L178] SORT_3 state_278 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_21 init_52_arg_1 = var_22; [L183] state_51 = init_52_arg_1 [L184] SORT_3 init_107_arg_1 = var_105; [L185] state_106 = init_107_arg_1 [L186] SORT_3 init_109_arg_1 = var_105; [L187] state_108 = init_109_arg_1 [L188] SORT_3 init_111_arg_1 = var_105; [L189] state_110 = init_111_arg_1 [L190] SORT_3 init_115_arg_1 = var_105; [L191] state_114 = init_115_arg_1 [L192] SORT_3 init_119_arg_1 = var_105; [L193] state_118 = init_119_arg_1 [L194] SORT_3 init_123_arg_1 = var_105; [L195] state_122 = init_123_arg_1 [L196] SORT_3 init_139_arg_1 = var_105; [L197] state_138 = init_139_arg_1 [L198] SORT_3 init_156_arg_1 = var_105; [L199] state_155 = init_156_arg_1 [L200] SORT_3 init_159_arg_1 = var_105; [L201] state_158 = init_159_arg_1 [L202] SORT_3 init_161_arg_1 = var_105; [L203] state_160 = init_161_arg_1 [L204] SORT_3 init_165_arg_1 = var_105; [L205] state_164 = init_165_arg_1 [L206] SORT_3 init_169_arg_1 = var_105; [L207] state_168 = init_169_arg_1 [L208] SORT_3 init_174_arg_1 = var_105; [L209] state_173 = init_174_arg_1 [L210] SORT_3 init_177_arg_1 = var_105; [L211] state_176 = init_177_arg_1 [L212] SORT_3 init_187_arg_1 = var_105; [L213] state_186 = init_187_arg_1 [L214] SORT_3 init_194_arg_1 = var_105; [L215] state_193 = init_194_arg_1 [L216] SORT_3 init_197_arg_1 = var_105; [L217] state_196 = init_197_arg_1 [L218] SORT_3 init_206_arg_1 = var_105; [L219] state_205 = init_206_arg_1 [L220] SORT_3 init_211_arg_1 = var_105; [L221] state_210 = init_211_arg_1 [L222] SORT_3 init_214_arg_1 = var_105; [L223] state_213 = init_214_arg_1 [L224] SORT_3 init_226_arg_1 = var_105; [L225] state_225 = init_226_arg_1 [L226] SORT_3 init_236_arg_1 = var_105; [L227] state_235 = init_236_arg_1 [L228] SORT_3 init_241_arg_1 = var_105; [L229] state_240 = init_241_arg_1 [L230] SORT_3 init_244_arg_1 = var_105; [L231] state_243 = init_244_arg_1 [L232] SORT_3 init_253_arg_1 = var_105; [L233] state_252 = init_253_arg_1 [L234] SORT_3 init_266_arg_1 = var_105; [L235] state_265 = init_266_arg_1 [L236] SORT_3 init_279_arg_1 = var_105; [L237] state_278 = init_279_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_412 = __VERIFIER_nondet_uchar() [L257] input_434 = __VERIFIER_nondet_uchar() [L258] input_449 = __VERIFIER_nondet_uchar() [L259] input_464 = __VERIFIER_nondet_uchar() [L260] input_479 = __VERIFIER_nondet_uchar() [L261] input_494 = __VERIFIER_nondet_uchar() [L262] input_509 = __VERIFIER_nondet_uchar() [L263] input_524 = __VERIFIER_nondet_uchar() [L264] input_539 = __VERIFIER_nondet_uchar() [L265] input_554 = __VERIFIER_nondet_uchar() [L266] input_569 = __VERIFIER_nondet_uchar() [L267] input_584 = __VERIFIER_nondet_uchar() [L268] input_599 = __VERIFIER_nondet_uchar() [L269] input_614 = __VERIFIER_nondet_uchar() [L270] input_629 = __VERIFIER_nondet_uchar() [L271] input_644 = __VERIFIER_nondet_uchar() [L272] input_660 = __VERIFIER_nondet_uchar() [L273] input_662 = __VERIFIER_nondet_uchar() [L274] input_664 = __VERIFIER_nondet_uchar() [L275] input_666 = __VERIFIER_nondet_uchar() [L276] input_668 = __VERIFIER_nondet_uchar() [L277] input_670 = __VERIFIER_nondet_uchar() [L278] input_672 = __VERIFIER_nondet_uchar() [L279] input_674 = __VERIFIER_nondet_uchar() [L280] input_679 = __VERIFIER_nondet_uchar() [L281] input_724 = __VERIFIER_nondet_uchar() [L282] input_725 = __VERIFIER_nondet_uchar() [L283] input_726 = __VERIFIER_nondet_uchar() [L284] input_727 = __VERIFIER_nondet_uchar() [L285] input_730 = __VERIFIER_nondet_uchar() [L286] input_734 = __VERIFIER_nondet_uchar() [L287] input_738 = __VERIFIER_nondet_uchar() [L288] input_746 = __VERIFIER_nondet_uchar() [L289] input_750 = __VERIFIER_nondet_uchar() [L290] input_752 = __VERIFIER_nondet_uchar() [L291] input_756 = __VERIFIER_nondet_uchar() [L292] input_759 = __VERIFIER_nondet_uchar() [L293] input_763 = __VERIFIER_nondet_uchar() [L294] input_768 = __VERIFIER_nondet_uchar() [L295] input_772 = __VERIFIER_nondet_uchar() [L296] input_777 = __VERIFIER_nondet_uchar() [L297] input_779 = __VERIFIER_nondet_uchar() [L298] input_780 = __VERIFIER_nondet_uchar() [L299] input_782 = __VERIFIER_nondet_uchar() [L300] input_786 = __VERIFIER_nondet_uchar() [L301] input_791 = __VERIFIER_nondet_uchar() [L302] input_798 = __VERIFIER_nondet_uchar() [L303] input_799 = __VERIFIER_nondet_uchar() [L304] input_801 = __VERIFIER_nondet_uchar() [L305] input_805 = __VERIFIER_nondet_uchar() [L306] input_810 = __VERIFIER_nondet_uchar() [L307] input_812 = __VERIFIER_nondet_uchar() [L308] input_813 = __VERIFIER_nondet_uchar() [L309] input_815 = __VERIFIER_nondet_uchar() [L310] input_819 = __VERIFIER_nondet_uchar() [L311] input_824 = __VERIFIER_nondet_uchar() [L312] input_828 = __VERIFIER_nondet_uchar() [L313] input_833 = __VERIFIER_nondet_uchar() [L314] input_835 = __VERIFIER_nondet_uchar() [L315] input_841 = __VERIFIER_nondet_uchar() [L316] input_853 = __VERIFIER_nondet_uchar() [L317] input_858 = __VERIFIER_nondet_uchar() [L318] input_867 = __VERIFIER_nondet_uchar() [L319] input_886 = __VERIFIER_nondet_uchar() [L320] input_893 = __VERIFIER_nondet_uchar() [L321] input_904 = __VERIFIER_nondet_uchar() [L322] input_910 = __VERIFIER_nondet_uchar() [L323] input_916 = __VERIFIER_nondet_uchar() [L324] input_922 = __VERIFIER_nondet_uchar() [L325] input_928 = __VERIFIER_nondet_uchar() [L326] input_934 = __VERIFIER_nondet_uchar() [L327] input_940 = __VERIFIER_nondet_uchar() [L328] input_946 = __VERIFIER_nondet_uchar() [L329] input_952 = __VERIFIER_nondet_uchar() [L330] input_958 = __VERIFIER_nondet_uchar() [L331] input_964 = __VERIFIER_nondet_uchar() [L332] input_970 = __VERIFIER_nondet_uchar() [L333] input_976 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_3 var_31_arg_0 = var_28; [L349] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_31_arg_0=1, var_31_arg_1=0, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L350] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L350] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L351] SORT_21 var_33_arg_0 = state_23; [L352] SORT_21 var_33_arg_1 = var_32; [L353] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L354] SORT_3 var_34_arg_0 = var_31; [L355] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_34_arg_0=1, var_34_arg_1=0, var_35=16, var_38=32, var_41=64, var_44=0] [L356] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L356] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L357] SORT_21 var_36_arg_0 = state_23; [L358] SORT_21 var_36_arg_1 = var_35; [L359] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L360] SORT_3 var_37_arg_0 = var_34; [L361] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_37_arg_0=1, var_37_arg_1=0, var_38=32, var_41=64, var_44=0] [L362] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L362] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L363] SORT_21 var_39_arg_0 = state_23; [L364] SORT_21 var_39_arg_1 = var_38; [L365] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L366] SORT_3 var_40_arg_0 = var_37; [L367] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_40_arg_0=1, var_40_arg_1=0, var_41=64, var_44=0] [L368] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L368] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_41; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_40; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_43_arg_0=1, var_43_arg_1=0, var_44=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_45_arg_0 = state_23; [L376] SORT_21 var_45_arg_1 = var_44; [L377] SORT_3 var_45 = var_45_arg_0 == var_45_arg_1; [L378] SORT_3 var_46_arg_0 = var_43; [L379] SORT_3 var_46_arg_1 = var_45; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46_arg_0=1, var_46_arg_1=0] [L380] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L380] SORT_3 var_46 = var_46_arg_0 | var_46_arg_1; [L381] SORT_21 var_47_arg_0 = state_23; [L382] SORT_21 var_47_arg_1 = var_22; [L383] SORT_3 var_47 = var_47_arg_0 == var_47_arg_1; [L384] SORT_21 var_48_arg_0 = state_23; [L385] SORT_21 var_48_arg_1 = var_26; [L386] SORT_3 var_48 = var_48_arg_0 == var_48_arg_1; [L387] SORT_3 var_49_arg_0 = var_47; [L388] SORT_3 var_49_arg_1 = var_48; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49_arg_0=1, var_49_arg_1=0] [L389] EXPR var_49_arg_0 | var_49_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L389] SORT_3 var_49 = var_49_arg_0 | var_49_arg_1; [L390] SORT_21 var_50_arg_0 = state_23; [L391] SORT_21 var_50_arg_1 = var_29; [L392] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L393] SORT_21 var_53_arg_0 = state_51; [L394] SORT_21 var_53_arg_1 = var_32; [L395] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L396] SORT_21 var_54_arg_0 = state_51; [L397] SORT_21 var_54_arg_1 = var_22; [L398] SORT_3 var_54 = var_54_arg_0 == var_54_arg_1; [L399] SORT_3 var_55_arg_0 = var_53; [L400] SORT_3 var_55_arg_1 = var_54; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0, var_55_arg_0=0, var_55_arg_1=1] [L401] EXPR var_55_arg_0 | var_55_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0] [L401] SORT_3 var_55 = var_55_arg_0 | var_55_arg_1; [L402] SORT_21 var_56_arg_0 = state_51; [L403] SORT_21 var_56_arg_1 = var_44; [L404] SORT_3 var_56 = var_56_arg_0 == var_56_arg_1; [L405] SORT_3 var_57_arg_0 = var_55; [L406] SORT_3 var_57_arg_1 = var_56; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0, var_57_arg_0=1, var_57_arg_1=0] [L407] EXPR var_57_arg_0 | var_57_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0] [L407] SORT_3 var_57 = var_57_arg_0 | var_57_arg_1; [L408] SORT_21 var_58_arg_0 = state_51; [L409] SORT_21 var_58_arg_1 = var_29; [L410] SORT_3 var_58 = var_58_arg_0 == var_58_arg_1; [L411] SORT_3 var_59_arg_0 = var_57; [L412] SORT_3 var_59_arg_1 = var_58; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0, var_59_arg_0=1, var_59_arg_1=0] [L413] EXPR var_59_arg_0 | var_59_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_50=0] [L413] SORT_3 var_59 = var_59_arg_0 | var_59_arg_1; [L414] SORT_3 var_60_arg_0 = var_50; [L415] SORT_3 var_60_arg_1 = var_59; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1, var_60_arg_0=0, var_60_arg_1=1] [L416] EXPR var_60_arg_0 & var_60_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_49=1] [L416] SORT_3 var_60 = var_60_arg_0 & var_60_arg_1; [L417] SORT_3 var_61_arg_0 = var_49; [L418] SORT_3 var_61_arg_1 = var_60; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_61_arg_0=1, var_61_arg_1=0] [L419] EXPR var_61_arg_0 | var_61_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L419] SORT_3 var_61 = var_61_arg_0 | var_61_arg_1; [L420] SORT_21 var_62_arg_0 = state_23; [L421] SORT_21 var_62_arg_1 = var_32; [L422] SORT_3 var_62 = var_62_arg_0 == var_62_arg_1; [L423] SORT_3 var_63_arg_0 = var_61; [L424] SORT_3 var_63_arg_1 = var_62; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_63_arg_0=1, var_63_arg_1=0] [L425] EXPR var_63_arg_0 | var_63_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L425] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L426] SORT_21 var_64_arg_0 = state_23; [L427] SORT_21 var_64_arg_1 = var_35; [L428] SORT_3 var_64 = var_64_arg_0 == var_64_arg_1; [L429] SORT_3 var_65_arg_0 = var_63; [L430] SORT_3 var_65_arg_1 = var_64; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_65_arg_0=1, var_65_arg_1=0] [L431] EXPR var_65_arg_0 | var_65_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L431] SORT_3 var_65 = var_65_arg_0 | var_65_arg_1; [L432] SORT_21 var_66_arg_0 = state_23; [L433] SORT_21 var_66_arg_1 = var_38; [L434] SORT_3 var_66 = var_66_arg_0 == var_66_arg_1; [L435] SORT_3 var_67_arg_0 = var_65; [L436] SORT_3 var_67_arg_1 = var_66; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_67_arg_0=1, var_67_arg_1=0] [L437] EXPR var_67_arg_0 | var_67_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L437] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L438] SORT_21 var_68_arg_0 = state_23; [L439] SORT_21 var_68_arg_1 = var_41; [L440] SORT_3 var_68 = var_68_arg_0 == var_68_arg_1; [L441] SORT_3 var_69_arg_0 = var_67; [L442] SORT_3 var_69_arg_1 = var_68; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_69_arg_0=1, var_69_arg_1=0] [L443] EXPR var_69_arg_0 | var_69_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L443] SORT_3 var_69 = var_69_arg_0 | var_69_arg_1; [L444] SORT_21 var_70_arg_0 = state_23; [L445] SORT_21 var_70_arg_1 = var_44; [L446] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L447] SORT_3 var_71_arg_0 = var_69; [L448] SORT_3 var_71_arg_1 = var_70; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1, var_71_arg_0=1, var_71_arg_1=0] [L449] EXPR var_71_arg_0 | var_71_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46=1] [L449] SORT_3 var_71 = var_71_arg_0 | var_71_arg_1; [L450] SORT_3 var_72_arg_0 = var_46; [L451] SORT_3 var_72_arg_1 = var_71; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72_arg_0=1, var_72_arg_1=1] [L452] EXPR var_72_arg_0 & var_72_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L452] SORT_3 var_72 = var_72_arg_0 & var_72_arg_1; [L453] SORT_21 var_73_arg_0 = state_23; [L454] SORT_21 var_73_arg_1 = var_29; [L455] SORT_3 var_73 = var_73_arg_0 == var_73_arg_1; [L456] SORT_21 var_74_arg_0 = state_51; [L457] SORT_21 var_74_arg_1 = var_32; [L458] SORT_3 var_74 = var_74_arg_0 == var_74_arg_1; [L459] SORT_21 var_75_arg_0 = state_51; [L460] SORT_21 var_75_arg_1 = var_22; [L461] SORT_3 var_75 = var_75_arg_0 == var_75_arg_1; [L462] SORT_3 var_76_arg_0 = var_74; [L463] SORT_3 var_76_arg_1 = var_75; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0, var_76_arg_0=0, var_76_arg_1=1] [L464] EXPR var_76_arg_0 | var_76_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0] [L464] SORT_3 var_76 = var_76_arg_0 | var_76_arg_1; [L465] SORT_21 var_77_arg_0 = state_51; [L466] SORT_21 var_77_arg_1 = var_44; [L467] SORT_3 var_77 = var_77_arg_0 == var_77_arg_1; [L468] SORT_3 var_78_arg_0 = var_76; [L469] SORT_3 var_78_arg_1 = var_77; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0, var_78_arg_0=1, var_78_arg_1=0] [L470] EXPR var_78_arg_0 | var_78_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0] [L470] SORT_3 var_78 = var_78_arg_0 | var_78_arg_1; [L471] SORT_21 var_79_arg_0 = state_51; [L472] SORT_21 var_79_arg_1 = var_29; [L473] SORT_3 var_79 = var_79_arg_0 == var_79_arg_1; [L474] SORT_3 var_80_arg_0 = var_78; [L475] SORT_3 var_80_arg_1 = var_79; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0, var_80_arg_0=1, var_80_arg_1=0] [L476] EXPR var_80_arg_0 | var_80_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_73=0] [L476] SORT_3 var_80 = var_80_arg_0 | var_80_arg_1; [L477] SORT_3 var_81_arg_0 = var_73; [L478] SORT_3 var_81_arg_1 = var_80; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_81_arg_0=0, var_81_arg_1=1] [L479] EXPR var_81_arg_0 & var_81_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1] [L479] SORT_3 var_81 = var_81_arg_0 & var_81_arg_1; [L480] SORT_21 var_82_arg_0 = state_23; [L481] SORT_21 var_82_arg_1 = var_29; [L482] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L483] SORT_3 var_83_arg_0 = var_82; [L484] SORT_3 var_83 = ~var_83_arg_0; [L485] SORT_3 var_84_arg_0 = var_81; [L486] SORT_3 var_84_arg_1 = var_83; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1, var_84_arg_0=0, var_84_arg_1=-1] [L487] EXPR var_84_arg_0 | var_84_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_72=1] [L487] SORT_3 var_84 = var_84_arg_0 | var_84_arg_1; [L488] SORT_3 var_85_arg_0 = var_72; [L489] SORT_3 var_85_arg_1 = var_84; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85_arg_0=1, var_85_arg_1=255] [L490] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L490] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L491] SORT_21 var_86_arg_0 = state_23; [L492] SORT_21 var_86_arg_1 = var_22; [L493] SORT_3 var_86 = var_86_arg_0 == var_86_arg_1; [L494] SORT_21 var_87_arg_0 = state_51; [L495] SORT_21 var_87_arg_1 = var_44; [L496] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L497] SORT_21 var_88_arg_0 = state_51; [L498] SORT_21 var_88_arg_1 = var_22; [L499] SORT_3 var_88 = var_88_arg_0 == var_88_arg_1; [L500] SORT_3 var_89_arg_0 = var_87; [L501] SORT_3 var_89_arg_1 = var_88; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_89_arg_0=0, var_89_arg_1=1] [L502] EXPR var_89_arg_0 | var_89_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L502] SORT_3 var_89 = var_89_arg_0 | var_89_arg_1; [L503] SORT_21 var_90_arg_0 = state_51; [L504] SORT_21 var_90_arg_1 = var_26; [L505] SORT_3 var_90 = var_90_arg_0 == var_90_arg_1; [L506] SORT_3 var_91_arg_0 = var_89; [L507] SORT_3 var_91_arg_1 = var_90; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_91_arg_0=1, var_91_arg_1=0] [L508] EXPR var_91_arg_0 | var_91_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L508] SORT_3 var_91 = var_91_arg_0 | var_91_arg_1; [L509] SORT_21 var_92_arg_0 = state_51; [L510] SORT_21 var_92_arg_1 = var_29; [L511] SORT_3 var_92 = var_92_arg_0 == var_92_arg_1; [L512] SORT_3 var_93_arg_0 = var_91; [L513] SORT_3 var_93_arg_1 = var_92; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_93_arg_0=1, var_93_arg_1=0] [L514] EXPR var_93_arg_0 | var_93_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L514] SORT_3 var_93 = var_93_arg_0 | var_93_arg_1; [L515] SORT_21 var_94_arg_0 = state_51; [L516] SORT_21 var_94_arg_1 = var_41; [L517] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L518] SORT_3 var_95_arg_0 = var_93; [L519] SORT_3 var_95_arg_1 = var_94; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1, var_95_arg_0=1, var_95_arg_1=0] [L520] EXPR var_95_arg_0 | var_95_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_86=1] [L520] SORT_3 var_95 = var_95_arg_0 | var_95_arg_1; [L521] SORT_3 var_96_arg_0 = var_86; [L522] SORT_3 var_96_arg_1 = var_95; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_96_arg_0=1, var_96_arg_1=1] [L523] EXPR var_96_arg_0 & var_96_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_23=1, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0] [L523] SORT_3 var_96 = var_96_arg_0 & var_96_arg_1; [L524] SORT_21 var_97_arg_0 = state_23; [L525] SORT_21 var_97_arg_1 = var_22; [L526] SORT_3 var_97 = var_97_arg_0 == var_97_arg_1; [L527] SORT_3 var_98_arg_0 = var_97; [L528] SORT_3 var_98 = ~var_98_arg_0; [L529] SORT_3 var_99_arg_0 = var_96; [L530] SORT_3 var_99_arg_1 = var_98; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0, var_99_arg_0=1, var_99_arg_1=-2] [L531] EXPR var_99_arg_0 | var_99_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_85=0] [L531] SORT_3 var_99 = var_99_arg_0 | var_99_arg_1; [L532] SORT_3 var_100_arg_0 = var_85; [L533] SORT_3 var_100_arg_1 = var_99; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_100_arg_0=0, var_100_arg_1=255, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L534] EXPR var_100_arg_0 & var_100_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L534] SORT_3 var_100 = var_100_arg_0 & var_100_arg_1; [L535] SORT_3 var_102_arg_0 = var_100; [L536] SORT_3 var_102 = ~var_102_arg_0; [L537] SORT_3 var_103_arg_0 = var_101; [L538] SORT_3 var_103_arg_1 = var_102; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_103_arg_0=1, var_103_arg_1=-1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L539] EXPR var_103_arg_0 & var_103_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L539] SORT_3 var_103 = var_103_arg_0 & var_103_arg_1; [L540] EXPR var_103 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_106=0, state_108=0, state_110=0, state_114=0, state_118=0, state_122=0, state_138=0, state_155=0, state_158=0, state_160=0, state_164=0, state_168=0, state_173=0, state_176=0, state_186=0, state_193=0, state_196=0, state_205=0, state_210=0, state_213=0, state_225=0, state_235=0, state_240=0, state_243=0, state_252=0, state_265=0, state_278=0, state_51=1, var_101=1, var_105=0, var_190=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0] [L540] var_103 = var_103 & mask_SORT_3 [L541] SORT_3 bad_104_arg_0 = var_103; [L542] CALL __VERIFIER_assert(!(bad_104_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1212 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.4s, OverallIterations: 50, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 46.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89784 SdHoareTripleChecker+Valid, 43.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89784 mSDsluCounter, 452935 SdHoareTripleChecker+Invalid, 36.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 380124 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104367 IncrementalHoareTripleChecker+Invalid, 104411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 72811 mSDtfsCounter, 104367 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 102 SyntacticMatches, 9 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1702occurred in iteration=46, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 49 MinimizatonAttempts, 7678 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 7414 NumberOfCodeBlocks, 7414 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 7203 ConstructedInterpolants, 0 QuantifiedInterpolants, 30554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 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-07 23:49:04,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.pj_icu.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 81684cd6f6f9906a1fa983a1abdb27554546d8d43af37740ea6944465197b3b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:49:06,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:49:06,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:49:06,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:49:06,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:49:06,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:49:06,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:49:06,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:49:06,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:49:06,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:49:06,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:49:06,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:49:06,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:49:06,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:49:06,875 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:49:06,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:49:06,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:49:06,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:49:06,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:49:06,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:49:06,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:49:06,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:49:06,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:49:06,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:49:06,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:49:06,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:49:06,877 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 -> 81684cd6f6f9906a1fa983a1abdb27554546d8d43af37740ea6944465197b3b8 [2025-02-07 23:49:07,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:49:07,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:49:07,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:49:07,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:49:07,128 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:49:07,129 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.pj_icu.c