./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:46:10,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:46:10,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:46:10,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:46:10,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:46:11,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:46:11,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:46:11,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:46:11,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:46:11,015 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:46:11,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:46:11,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:46:11,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:46:11,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:46:11,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:46:11,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:46:11,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:46:11,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:46:11,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:46:11,018 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2025-03-08 08:46:11,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:46:11,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:46:11,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:46:11,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:46:11,250 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:46:11,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-08 08:46:12,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afc76f14/607ebb8ee76f4f44a3a3e667cb7e6238/FLAG41fa86ca8 [2025-03-08 08:46:12,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:46:12,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-08 08:46:12,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afc76f14/607ebb8ee76f4f44a3a3e667cb7e6238/FLAG41fa86ca8 [2025-03-08 08:46:12,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afc76f14/607ebb8ee76f4f44a3a3e667cb7e6238 [2025-03-08 08:46:12,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:46:12,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:46:12,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:46:12,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:46:12,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:46:12,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:12,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa65188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12, skipping insertion in model container [2025-03-08 08:46:12,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:12,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:46:12,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-08 08:46:12,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:46:12,878 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:46:12,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-08 08:46:12,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:46:12,924 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:46:12,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12 WrapperNode [2025-03-08 08:46:12,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:46:12,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:46:12,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:46:12,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:46:12,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:12,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:12,991 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 549 [2025-03-08 08:46:12,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:46:12,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:46:12,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:46:12,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:46:12,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:12,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,039 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 08:46:13,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,058 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:46:13,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:46:13,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:46:13,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:46:13,088 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (1/1) ... [2025-03-08 08:46:13,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:46:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:46:13,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:46:13,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:46:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:46:13,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:46:13,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:46:13,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:46:13,231 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:46:13,232 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:46:13,873 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2025-03-08 08:46:13,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:46:13,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:46:13,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:46:13,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:46:13 BoogieIcfgContainer [2025-03-08 08:46:13,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:46:13,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:46:13,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:46:13,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:46:13,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:46:12" (1/3) ... [2025-03-08 08:46:13,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5976a64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:46:13, skipping insertion in model container [2025-03-08 08:46:13,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:46:12" (2/3) ... [2025-03-08 08:46:13,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5976a64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:46:13, skipping insertion in model container [2025-03-08 08:46:13,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:46:13" (3/3) ... [2025-03-08 08:46:13,919 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2025-03-08 08:46:13,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:46:13,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Barrel.c that has 1 procedures, 158 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:46:13,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:46:13,986 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;@1d920e97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:46:13,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:46:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 08:46:13,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:13,997 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] [2025-03-08 08:46:13,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash 925704785, now seen corresponding path program 1 times [2025-03-08 08:46:14,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:14,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383404673] [2025-03-08 08:46:14,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:14,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:14,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 08:46:14,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 08:46:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:14,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:14,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383404673] [2025-03-08 08:46:14,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383404673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:14,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:14,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781435650] [2025-03-08 08:46:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:14,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:14,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:14,851 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 0 states have call successors, (0), 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 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:14,980 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2025-03-08 08:46:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:14,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-08 08:46:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:14,990 INFO L225 Difference]: With dead ends: 297 [2025-03-08 08:46:14,990 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 08:46:14,991 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-03-08 08:46:14,993 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:14,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 08:46:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-08 08:46:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4807692307692308) internal successors, (231), 156 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2025-03-08 08:46:15,022 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 79 [2025-03-08 08:46:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:15,023 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2025-03-08 08:46:15,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2025-03-08 08:46:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 08:46:15,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:15,024 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] [2025-03-08 08:46:15,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 08:46:15,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:15,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1363243592, now seen corresponding path program 1 times [2025-03-08 08:46:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:15,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154582570] [2025-03-08 08:46:15,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:15,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 08:46:15,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 08:46:15,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:15,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154582570] [2025-03-08 08:46:15,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154582570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:15,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:15,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:15,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984238348] [2025-03-08 08:46:15,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:15,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:15,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:15,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:15,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:15,333 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:15,438 INFO L93 Difference]: Finished difference Result 298 states and 439 transitions. [2025-03-08 08:46:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:15,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-08 08:46:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:15,440 INFO L225 Difference]: With dead ends: 298 [2025-03-08 08:46:15,440 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 08:46:15,440 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-03-08 08:46:15,441 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:15,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 08:46:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-08 08:46:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4746835443037976) internal successors, (233), 158 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 233 transitions. [2025-03-08 08:46:15,452 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 233 transitions. Word has length 80 [2025-03-08 08:46:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:15,453 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 233 transitions. [2025-03-08 08:46:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 233 transitions. [2025-03-08 08:46:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 08:46:15,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:15,456 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] [2025-03-08 08:46:15,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:46:15,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:15,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1674336468, now seen corresponding path program 1 times [2025-03-08 08:46:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811275910] [2025-03-08 08:46:15,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:15,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:15,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 08:46:15,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 08:46:15,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:15,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:15,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811275910] [2025-03-08 08:46:15,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811275910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:15,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:15,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:46:15,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598278120] [2025-03-08 08:46:15,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:15,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:46:15,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:15,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:46:15,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:46:15,925 INFO L87 Difference]: Start difference. First operand 159 states and 233 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:16,031 INFO L93 Difference]: Finished difference Result 304 states and 446 transitions. [2025-03-08 08:46:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:46:16,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 08:46:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:16,034 INFO L225 Difference]: With dead ends: 304 [2025-03-08 08:46:16,034 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 08:46:16,034 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-03-08 08:46:16,035 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 162 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:16,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 561 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 08:46:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2025-03-08 08:46:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4658385093167703) internal successors, (236), 161 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2025-03-08 08:46:16,048 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 81 [2025-03-08 08:46:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:16,048 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2025-03-08 08:46:16,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2025-03-08 08:46:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 08:46:16,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:16,049 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] [2025-03-08 08:46:16,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:46:16,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:16,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1495952104, now seen corresponding path program 1 times [2025-03-08 08:46:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:16,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676509893] [2025-03-08 08:46:16,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:16,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 08:46:16,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 08:46:16,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:16,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676509893] [2025-03-08 08:46:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676509893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:17,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:17,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:17,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664442660] [2025-03-08 08:46:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:17,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:17,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:17,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:17,353 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:17,691 INFO L93 Difference]: Finished difference Result 458 states and 668 transitions. [2025-03-08 08:46:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:17,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-08 08:46:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:17,693 INFO L225 Difference]: With dead ends: 458 [2025-03-08 08:46:17,693 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 08:46:17,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:17,696 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 435 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:17,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1108 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:46:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 08:46:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 170. [2025-03-08 08:46:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.455621301775148) internal successors, (246), 169 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 246 transitions. [2025-03-08 08:46:17,711 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 246 transitions. Word has length 82 [2025-03-08 08:46:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:17,711 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 246 transitions. [2025-03-08 08:46:17,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 246 transitions. [2025-03-08 08:46:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 08:46:17,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:17,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] [2025-03-08 08:46:17,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 08:46:17,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:17,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1516055803, now seen corresponding path program 1 times [2025-03-08 08:46:17,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:17,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356194767] [2025-03-08 08:46:17,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:17,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 08:46:17,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 08:46:17,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:17,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356194767] [2025-03-08 08:46:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356194767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827699040] [2025-03-08 08:46:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:18,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:18,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:18,502 INFO L87 Difference]: Start difference. First operand 170 states and 246 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:18,823 INFO L93 Difference]: Finished difference Result 463 states and 673 transitions. [2025-03-08 08:46:18,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-08 08:46:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:18,825 INFO L225 Difference]: With dead ends: 463 [2025-03-08 08:46:18,825 INFO L226 Difference]: Without dead ends: 319 [2025-03-08 08:46:18,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:18,826 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 428 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:18,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1152 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:46:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-08 08:46:18,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 183. [2025-03-08 08:46:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.4505494505494505) internal successors, (264), 182 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2025-03-08 08:46:18,836 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 264 transitions. Word has length 83 [2025-03-08 08:46:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:18,836 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 264 transitions. [2025-03-08 08:46:18,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 264 transitions. [2025-03-08 08:46:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 08:46:18,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:18,837 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] [2025-03-08 08:46:18,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 08:46:18,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -59669566, now seen corresponding path program 1 times [2025-03-08 08:46:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412210676] [2025-03-08 08:46:18,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:18,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 08:46:19,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 08:46:19,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:19,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412210676] [2025-03-08 08:46:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412210676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512846135] [2025-03-08 08:46:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:19,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:19,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:19,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:19,526 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:19,838 INFO L93 Difference]: Finished difference Result 468 states and 679 transitions. [2025-03-08 08:46:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-08 08:46:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:19,840 INFO L225 Difference]: With dead ends: 468 [2025-03-08 08:46:19,840 INFO L226 Difference]: Without dead ends: 324 [2025-03-08 08:46:19,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:19,841 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 623 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:19,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1109 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:46:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-08 08:46:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 196. [2025-03-08 08:46:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.4461538461538461) internal successors, (282), 195 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 282 transitions. [2025-03-08 08:46:19,850 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 282 transitions. Word has length 84 [2025-03-08 08:46:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:19,850 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 282 transitions. [2025-03-08 08:46:19,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 282 transitions. [2025-03-08 08:46:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 08:46:19,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:19,852 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] [2025-03-08 08:46:19,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 08:46:19,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:19,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1045526526, now seen corresponding path program 1 times [2025-03-08 08:46:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893463791] [2025-03-08 08:46:19,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:19,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 08:46:20,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 08:46:20,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:20,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:20,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893463791] [2025-03-08 08:46:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893463791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:46:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140186866] [2025-03-08 08:46:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:20,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:46:20,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:20,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:46:20,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:20,528 INFO L87 Difference]: Start difference. First operand 196 states and 282 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:20,725 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2025-03-08 08:46:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:46:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-08 08:46:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:20,727 INFO L225 Difference]: With dead ends: 362 [2025-03-08 08:46:20,727 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 08:46:20,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:20,727 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 4 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:20,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1072 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 08:46:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-03-08 08:46:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.4427860696517414) internal successors, (290), 201 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2025-03-08 08:46:20,743 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 84 [2025-03-08 08:46:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:20,743 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2025-03-08 08:46:20,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2025-03-08 08:46:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 08:46:20,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:20,744 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] [2025-03-08 08:46:20,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 08:46:20,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:20,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1843733169, now seen corresponding path program 1 times [2025-03-08 08:46:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:20,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134755438] [2025-03-08 08:46:20,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:20,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 08:46:20,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 08:46:20,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:20,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:21,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134755438] [2025-03-08 08:46:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134755438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:21,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:21,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584428990] [2025-03-08 08:46:21,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:21,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:21,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:21,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:21,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:21,195 INFO L87 Difference]: Start difference. First operand 202 states and 290 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:21,274 INFO L93 Difference]: Finished difference Result 371 states and 535 transitions. [2025-03-08 08:46:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:21,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-08 08:46:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:21,276 INFO L225 Difference]: With dead ends: 371 [2025-03-08 08:46:21,276 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 08:46:21,276 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-03-08 08:46:21,276 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:21,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 08:46:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 08:46:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.4343434343434343) internal successors, (284), 198 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 284 transitions. [2025-03-08 08:46:21,280 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 284 transitions. Word has length 84 [2025-03-08 08:46:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:21,280 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 284 transitions. [2025-03-08 08:46:21,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 284 transitions. [2025-03-08 08:46:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 08:46:21,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:21,281 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] [2025-03-08 08:46:21,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 08:46:21,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash 480025465, now seen corresponding path program 1 times [2025-03-08 08:46:21,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334966462] [2025-03-08 08:46:21,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:21,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 08:46:21,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 08:46:21,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334966462] [2025-03-08 08:46:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334966462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:21,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944986418] [2025-03-08 08:46:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:21,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:21,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:21,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:21,700 INFO L87 Difference]: Start difference. First operand 199 states and 284 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:21,782 INFO L93 Difference]: Finished difference Result 360 states and 516 transitions. [2025-03-08 08:46:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-08 08:46:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:21,783 INFO L225 Difference]: With dead ends: 360 [2025-03-08 08:46:21,783 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 08:46:21,783 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-03-08 08:46:21,784 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:21,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 08:46:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-08 08:46:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.427027027027027) internal successors, (264), 185 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2025-03-08 08:46:21,787 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 84 [2025-03-08 08:46:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:21,788 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2025-03-08 08:46:21,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2025-03-08 08:46:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 08:46:21,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:21,788 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] [2025-03-08 08:46:21,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 08:46:21,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:21,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash 962865123, now seen corresponding path program 1 times [2025-03-08 08:46:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:21,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024863490] [2025-03-08 08:46:21,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:21,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 08:46:21,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 08:46:21,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:21,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:22,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:22,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024863490] [2025-03-08 08:46:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024863490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:22,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 08:46:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405415069] [2025-03-08 08:46:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:22,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 08:46:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:22,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 08:46:22,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 08:46:22,360 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:22,613 INFO L93 Difference]: Finished difference Result 346 states and 497 transitions. [2025-03-08 08:46:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 08:46:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-08 08:46:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:22,614 INFO L225 Difference]: With dead ends: 346 [2025-03-08 08:46:22,614 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 08:46:22,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 08:46:22,615 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:22,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1540 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 08:46:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-03-08 08:46:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 196 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2025-03-08 08:46:22,619 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 85 [2025-03-08 08:46:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:22,619 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2025-03-08 08:46:22,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2025-03-08 08:46:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 08:46:22,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:22,620 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] [2025-03-08 08:46:22,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 08:46:22,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:22,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash 346664229, now seen corresponding path program 1 times [2025-03-08 08:46:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:22,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847311323] [2025-03-08 08:46:22,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:22,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 08:46:22,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 08:46:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847311323] [2025-03-08 08:46:23,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847311323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:23,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307276511] [2025-03-08 08:46:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:23,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:23,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:23,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:23,283 INFO L87 Difference]: Start difference. First operand 197 states and 279 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:23,568 INFO L93 Difference]: Finished difference Result 487 states and 699 transitions. [2025-03-08 08:46:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:23,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-08 08:46:23,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:23,570 INFO L225 Difference]: With dead ends: 487 [2025-03-08 08:46:23,571 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 08:46:23,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:23,571 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 404 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:23,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1111 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 08:46:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 210. [2025-03-08 08:46:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.4210526315789473) internal successors, (297), 209 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 297 transitions. [2025-03-08 08:46:23,579 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 297 transitions. Word has length 85 [2025-03-08 08:46:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:23,580 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 297 transitions. [2025-03-08 08:46:23,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 297 transitions. [2025-03-08 08:46:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 08:46:23,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:23,581 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] [2025-03-08 08:46:23,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 08:46:23,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:23,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2090470747, now seen corresponding path program 1 times [2025-03-08 08:46:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982172702] [2025-03-08 08:46:23,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:23,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 08:46:23,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 08:46:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:23,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:23,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:23,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982172702] [2025-03-08 08:46:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982172702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:23,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843082] [2025-03-08 08:46:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:23,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:23,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:23,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:23,927 INFO L87 Difference]: Start difference. First operand 210 states and 297 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:23,997 INFO L93 Difference]: Finished difference Result 380 states and 541 transitions. [2025-03-08 08:46:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-08 08:46:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:23,998 INFO L225 Difference]: With dead ends: 380 [2025-03-08 08:46:23,998 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 08:46:23,998 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-03-08 08:46:23,999 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:23,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 08:46:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-08 08:46:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4120603015075377) internal successors, (281), 199 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2025-03-08 08:46:24,003 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 85 [2025-03-08 08:46:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:24,003 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2025-03-08 08:46:24,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2025-03-08 08:46:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 08:46:24,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:24,004 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] [2025-03-08 08:46:24,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 08:46:24,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:24,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2029227116, now seen corresponding path program 1 times [2025-03-08 08:46:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:24,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696753662] [2025-03-08 08:46:24,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:24,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 08:46:24,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 08:46:24,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:24,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:24,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696753662] [2025-03-08 08:46:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696753662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:24,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274894488] [2025-03-08 08:46:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:24,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:24,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:24,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:24,496 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:24,774 INFO L93 Difference]: Finished difference Result 481 states and 687 transitions. [2025-03-08 08:46:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:24,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-08 08:46:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:24,776 INFO L225 Difference]: With dead ends: 481 [2025-03-08 08:46:24,776 INFO L226 Difference]: Without dead ends: 325 [2025-03-08 08:46:24,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:24,777 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 389 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:24,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1131 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-08 08:46:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 213. [2025-03-08 08:46:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4103773584905661) internal successors, (299), 212 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2025-03-08 08:46:24,782 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 86 [2025-03-08 08:46:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:24,782 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2025-03-08 08:46:24,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2025-03-08 08:46:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 08:46:24,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:24,783 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] [2025-03-08 08:46:24,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 08:46:24,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:24,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 630002770, now seen corresponding path program 1 times [2025-03-08 08:46:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604509347] [2025-03-08 08:46:24,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:24,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 08:46:24,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 08:46:24,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:24,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604509347] [2025-03-08 08:46:25,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604509347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:25,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:25,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 08:46:25,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570845322] [2025-03-08 08:46:25,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:25,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 08:46:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:25,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 08:46:25,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-03-08 08:46:25,981 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:27,081 INFO L93 Difference]: Finished difference Result 482 states and 691 transitions. [2025-03-08 08:46:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 08:46:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-08 08:46:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:27,083 INFO L225 Difference]: With dead ends: 482 [2025-03-08 08:46:27,083 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 08:46:27,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1885, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 08:46:27,086 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 391 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:27,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2300 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:46:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 08:46:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 228. [2025-03-08 08:46:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4096916299559472) internal successors, (320), 227 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 320 transitions. [2025-03-08 08:46:27,092 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 320 transitions. Word has length 86 [2025-03-08 08:46:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:27,092 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 320 transitions. [2025-03-08 08:46:27,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 320 transitions. [2025-03-08 08:46:27,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 08:46:27,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:27,093 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] [2025-03-08 08:46:27,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 08:46:27,094 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:27,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1874417957, now seen corresponding path program 1 times [2025-03-08 08:46:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582708300] [2025-03-08 08:46:27,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:27,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 08:46:27,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 08:46:27,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:27,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582708300] [2025-03-08 08:46:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582708300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:27,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:27,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:27,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767026083] [2025-03-08 08:46:27,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:27,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:27,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:27,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:27,628 INFO L87 Difference]: Start difference. First operand 228 states and 320 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:27,811 INFO L93 Difference]: Finished difference Result 418 states and 594 transitions. [2025-03-08 08:46:27,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:46:27,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-08 08:46:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:27,812 INFO L225 Difference]: With dead ends: 418 [2025-03-08 08:46:27,812 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 08:46:27,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:27,814 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 3 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:27,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1249 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 08:46:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-08 08:46:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4034334763948497) internal successors, (327), 233 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 327 transitions. [2025-03-08 08:46:27,818 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 327 transitions. Word has length 86 [2025-03-08 08:46:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:27,819 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 327 transitions. [2025-03-08 08:46:27,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 327 transitions. [2025-03-08 08:46:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 08:46:27,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:27,819 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] [2025-03-08 08:46:27,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 08:46:27,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:27,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 822093647, now seen corresponding path program 1 times [2025-03-08 08:46:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:27,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519421261] [2025-03-08 08:46:27,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:27,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 08:46:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 08:46:27,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:27,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:28,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519421261] [2025-03-08 08:46:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519421261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:28,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:28,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532987978] [2025-03-08 08:46:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:28,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:28,456 INFO L87 Difference]: Start difference. First operand 234 states and 327 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:28,747 INFO L93 Difference]: Finished difference Result 527 states and 749 transitions. [2025-03-08 08:46:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:28,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-08 08:46:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:28,748 INFO L225 Difference]: With dead ends: 527 [2025-03-08 08:46:28,749 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 08:46:28,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:28,749 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 549 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:28,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1125 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 08:46:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 247. [2025-03-08 08:46:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.4065040650406504) internal successors, (346), 246 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 346 transitions. [2025-03-08 08:46:28,756 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 346 transitions. Word has length 87 [2025-03-08 08:46:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:28,756 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 346 transitions. [2025-03-08 08:46:28,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 346 transitions. [2025-03-08 08:46:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 08:46:28,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:28,757 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] [2025-03-08 08:46:28,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 08:46:28,757 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:28,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 744176762, now seen corresponding path program 1 times [2025-03-08 08:46:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:28,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124115721] [2025-03-08 08:46:28,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:28,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 08:46:28,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 08:46:28,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:28,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:29,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124115721] [2025-03-08 08:46:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124115721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:29,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 08:46:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500674038] [2025-03-08 08:46:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:29,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 08:46:29,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:29,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 08:46:29,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-08 08:46:29,434 INFO L87 Difference]: Start difference. First operand 247 states and 346 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:29,888 INFO L93 Difference]: Finished difference Result 465 states and 661 transitions. [2025-03-08 08:46:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 08:46:29,889 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-08 08:46:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:29,890 INFO L225 Difference]: With dead ends: 465 [2025-03-08 08:46:29,890 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 08:46:29,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-08 08:46:29,891 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 14 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:29,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2529 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 08:46:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 08:46:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2025-03-08 08:46:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.4065934065934067) internal successors, (384), 273 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 384 transitions. [2025-03-08 08:46:29,896 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 384 transitions. Word has length 87 [2025-03-08 08:46:29,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:29,897 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 384 transitions. [2025-03-08 08:46:29,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 384 transitions. [2025-03-08 08:46:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 08:46:29,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:29,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] [2025-03-08 08:46:29,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 08:46:29,898 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:29,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash -227056243, now seen corresponding path program 1 times [2025-03-08 08:46:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397127019] [2025-03-08 08:46:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:29,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 08:46:29,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 08:46:29,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:29,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:30,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397127019] [2025-03-08 08:46:30,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397127019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:30,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:30,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101894345] [2025-03-08 08:46:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:30,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:30,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:30,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:30,185 INFO L87 Difference]: Start difference. First operand 274 states and 384 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:30,233 INFO L93 Difference]: Finished difference Result 494 states and 700 transitions. [2025-03-08 08:46:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:30,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-08 08:46:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:30,235 INFO L225 Difference]: With dead ends: 494 [2025-03-08 08:46:30,235 INFO L226 Difference]: Without dead ends: 271 [2025-03-08 08:46:30,235 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-03-08 08:46:30,235 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:30,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:46:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-08 08:46:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-08 08:46:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.4) internal successors, (378), 270 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 378 transitions. [2025-03-08 08:46:30,240 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 378 transitions. Word has length 87 [2025-03-08 08:46:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:30,240 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 378 transitions. [2025-03-08 08:46:30,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 378 transitions. [2025-03-08 08:46:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 08:46:30,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:30,241 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] [2025-03-08 08:46:30,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 08:46:30,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:30,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1604210922, now seen corresponding path program 1 times [2025-03-08 08:46:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724139099] [2025-03-08 08:46:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:30,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 08:46:30,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 08:46:30,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724139099] [2025-03-08 08:46:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724139099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:30,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:30,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:30,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518698183] [2025-03-08 08:46:30,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:30,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:30,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:30,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:30,704 INFO L87 Difference]: Start difference. First operand 271 states and 378 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:30,947 INFO L93 Difference]: Finished difference Result 579 states and 820 transitions. [2025-03-08 08:46:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-08 08:46:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:30,949 INFO L225 Difference]: With dead ends: 579 [2025-03-08 08:46:30,949 INFO L226 Difference]: Without dead ends: 380 [2025-03-08 08:46:30,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:30,950 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 374 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:30,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1092 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-08 08:46:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 284. [2025-03-08 08:46:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.3992932862190812) internal successors, (396), 283 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2025-03-08 08:46:30,955 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 396 transitions. Word has length 88 [2025-03-08 08:46:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 396 transitions. [2025-03-08 08:46:30,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2025-03-08 08:46:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 08:46:30,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:30,956 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] [2025-03-08 08:46:30,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 08:46:30,957 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:30,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash -938760570, now seen corresponding path program 1 times [2025-03-08 08:46:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:30,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179617012] [2025-03-08 08:46:30,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:30,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:30,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 08:46:31,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 08:46:31,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:31,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:31,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179617012] [2025-03-08 08:46:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179617012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 08:46:31,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832263502] [2025-03-08 08:46:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:31,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 08:46:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:31,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 08:46:31,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-03-08 08:46:31,886 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:32,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:32,356 INFO L93 Difference]: Finished difference Result 511 states and 722 transitions. [2025-03-08 08:46:32,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 08:46:32,357 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-08 08:46:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:32,358 INFO L225 Difference]: With dead ends: 511 [2025-03-08 08:46:32,358 INFO L226 Difference]: Without dead ends: 299 [2025-03-08 08:46:32,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-03-08 08:46:32,358 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 17 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:32,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2871 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:46:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-08 08:46:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-03-08 08:46:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 296 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 414 transitions. [2025-03-08 08:46:32,363 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 414 transitions. Word has length 88 [2025-03-08 08:46:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:32,363 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 414 transitions. [2025-03-08 08:46:32,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 414 transitions. [2025-03-08 08:46:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 08:46:32,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:32,364 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] [2025-03-08 08:46:32,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 08:46:32,364 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1884086442, now seen corresponding path program 1 times [2025-03-08 08:46:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065822616] [2025-03-08 08:46:32,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:32,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 08:46:32,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 08:46:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:32,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065822616] [2025-03-08 08:46:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065822616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:32,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:32,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:32,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483050547] [2025-03-08 08:46:32,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:32,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:32,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:32,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:32,855 INFO L87 Difference]: Start difference. First operand 297 states and 414 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:32,986 INFO L93 Difference]: Finished difference Result 533 states and 752 transitions. [2025-03-08 08:46:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:32,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-08 08:46:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:32,987 INFO L225 Difference]: With dead ends: 533 [2025-03-08 08:46:32,987 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 08:46:32,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:32,988 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:32,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1242 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 08:46:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-03-08 08:46:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.3941368078175895) internal successors, (428), 307 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 428 transitions. [2025-03-08 08:46:32,996 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 428 transitions. Word has length 88 [2025-03-08 08:46:32,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:32,996 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 428 transitions. [2025-03-08 08:46:32,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 428 transitions. [2025-03-08 08:46:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 08:46:32,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:32,997 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] [2025-03-08 08:46:32,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 08:46:32,997 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:32,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash -432726795, now seen corresponding path program 1 times [2025-03-08 08:46:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656590143] [2025-03-08 08:46:32,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:32,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:33,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 08:46:33,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 08:46:33,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:33,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656590143] [2025-03-08 08:46:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656590143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:33,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:33,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18193208] [2025-03-08 08:46:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:33,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:33,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:33,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:33,281 INFO L87 Difference]: Start difference. First operand 308 states and 428 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:33,344 INFO L93 Difference]: Finished difference Result 550 states and 772 transitions. [2025-03-08 08:46:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:33,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-08 08:46:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:33,345 INFO L225 Difference]: With dead ends: 550 [2025-03-08 08:46:33,345 INFO L226 Difference]: Without dead ends: 277 [2025-03-08 08:46:33,345 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-03-08 08:46:33,346 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:33,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-08 08:46:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 271. [2025-03-08 08:46:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.3888888888888888) internal successors, (375), 270 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2025-03-08 08:46:33,353 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 88 [2025-03-08 08:46:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:33,353 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2025-03-08 08:46:33,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2025-03-08 08:46:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 08:46:33,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:33,353 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] [2025-03-08 08:46:33,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 08:46:33,354 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:33,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:33,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1841445857, now seen corresponding path program 1 times [2025-03-08 08:46:33,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:33,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515630150] [2025-03-08 08:46:33,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:33,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:33,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 08:46:33,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 08:46:33,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:33,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515630150] [2025-03-08 08:46:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515630150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:33,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:33,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491847600] [2025-03-08 08:46:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:33,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:33,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:33,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:33,828 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:33,980 INFO L93 Difference]: Finished difference Result 486 states and 683 transitions. [2025-03-08 08:46:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-08 08:46:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:33,982 INFO L225 Difference]: With dead ends: 486 [2025-03-08 08:46:33,982 INFO L226 Difference]: Without dead ends: 283 [2025-03-08 08:46:33,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:33,983 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 3 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:33,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1237 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-08 08:46:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2025-03-08 08:46:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.3862815884476534) internal successors, (384), 277 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 384 transitions. [2025-03-08 08:46:33,986 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 384 transitions. Word has length 89 [2025-03-08 08:46:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:33,987 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 384 transitions. [2025-03-08 08:46:33,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 384 transitions. [2025-03-08 08:46:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 08:46:33,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:33,987 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] [2025-03-08 08:46:33,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 08:46:33,988 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:33,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1076796281, now seen corresponding path program 1 times [2025-03-08 08:46:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:33,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54207841] [2025-03-08 08:46:33,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:34,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 08:46:34,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 08:46:34,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:34,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:34,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54207841] [2025-03-08 08:46:34,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54207841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:34,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:34,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35580107] [2025-03-08 08:46:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:34,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:34,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:34,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:34,428 INFO L87 Difference]: Start difference. First operand 278 states and 384 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:34,629 INFO L93 Difference]: Finished difference Result 588 states and 827 transitions. [2025-03-08 08:46:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:34,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-08 08:46:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:34,631 INFO L225 Difference]: With dead ends: 588 [2025-03-08 08:46:34,631 INFO L226 Difference]: Without dead ends: 379 [2025-03-08 08:46:34,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:34,632 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 496 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:34,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1115 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-08 08:46:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 291. [2025-03-08 08:46:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.3862068965517242) internal successors, (402), 290 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 402 transitions. [2025-03-08 08:46:34,637 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 402 transitions. Word has length 89 [2025-03-08 08:46:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:34,637 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 402 transitions. [2025-03-08 08:46:34,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2025-03-08 08:46:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 08:46:34,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:34,638 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] [2025-03-08 08:46:34,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 08:46:34,639 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:34,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1512958101, now seen corresponding path program 1 times [2025-03-08 08:46:34,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:34,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059406505] [2025-03-08 08:46:34,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:34,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 08:46:34,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 08:46:34,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059406505] [2025-03-08 08:46:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059406505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:35,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:35,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-08 08:46:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898087670] [2025-03-08 08:46:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:35,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 08:46:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:35,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 08:46:35,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2025-03-08 08:46:35,488 INFO L87 Difference]: Start difference. First operand 291 states and 402 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:36,036 INFO L93 Difference]: Finished difference Result 563 states and 789 transitions. [2025-03-08 08:46:36,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 08:46:36,040 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-08 08:46:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:36,041 INFO L225 Difference]: With dead ends: 563 [2025-03-08 08:46:36,041 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 08:46:36,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2025-03-08 08:46:36,042 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 20 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:36,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3463 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:46:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 08:46:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 335. [2025-03-08 08:46:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.3892215568862276) internal successors, (464), 334 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 464 transitions. [2025-03-08 08:46:36,047 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 464 transitions. Word has length 89 [2025-03-08 08:46:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:36,047 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 464 transitions. [2025-03-08 08:46:36,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2025-03-08 08:46:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 08:46:36,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:36,052 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] [2025-03-08 08:46:36,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 08:46:36,053 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:36,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash 560076013, now seen corresponding path program 1 times [2025-03-08 08:46:36,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547843939] [2025-03-08 08:46:36,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 08:46:36,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 08:46:36,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:36,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547843939] [2025-03-08 08:46:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547843939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:36,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:36,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:46:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63150230] [2025-03-08 08:46:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:36,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:46:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:36,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:46:36,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:46:36,383 INFO L87 Difference]: Start difference. First operand 335 states and 464 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:36,487 INFO L93 Difference]: Finished difference Result 691 states and 971 transitions. [2025-03-08 08:46:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:46:36,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-08 08:46:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:36,488 INFO L225 Difference]: With dead ends: 691 [2025-03-08 08:46:36,488 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 08:46:36,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-08 08:46:36,489 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 347 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:36,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 502 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 08:46:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 329. [2025-03-08 08:46:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.3841463414634145) internal successors, (454), 328 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 454 transitions. [2025-03-08 08:46:36,493 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 454 transitions. Word has length 90 [2025-03-08 08:46:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:36,494 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 454 transitions. [2025-03-08 08:46:36,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 454 transitions. [2025-03-08 08:46:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 08:46:36,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:36,494 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] [2025-03-08 08:46:36,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 08:46:36,495 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:36,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1860816045, now seen corresponding path program 1 times [2025-03-08 08:46:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283352723] [2025-03-08 08:46:36,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:36,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 08:46:36,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 08:46:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:36,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283352723] [2025-03-08 08:46:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283352723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:36,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373206916] [2025-03-08 08:46:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:36,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:36,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:36,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:36,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:36,880 INFO L87 Difference]: Start difference. First operand 329 states and 454 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:36,923 INFO L93 Difference]: Finished difference Result 586 states and 821 transitions. [2025-03-08 08:46:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-08 08:46:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:36,924 INFO L225 Difference]: With dead ends: 586 [2025-03-08 08:46:36,924 INFO L226 Difference]: Without dead ends: 326 [2025-03-08 08:46:36,925 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-03-08 08:46:36,925 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:36,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:46:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-08 08:46:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-08 08:46:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.3784615384615384) internal successors, (448), 325 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 448 transitions. [2025-03-08 08:46:36,929 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 448 transitions. Word has length 90 [2025-03-08 08:46:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 448 transitions. [2025-03-08 08:46:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 448 transitions. [2025-03-08 08:46:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 08:46:36,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:36,929 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] [2025-03-08 08:46:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 08:46:36,930 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1178473536, now seen corresponding path program 1 times [2025-03-08 08:46:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038099264] [2025-03-08 08:46:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:36,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 08:46:37,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 08:46:37,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:37,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:37,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:37,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038099264] [2025-03-08 08:46:37,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038099264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:37,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543882885] [2025-03-08 08:46:37,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:37,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:37,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:37,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:37,348 INFO L87 Difference]: Start difference. First operand 326 states and 448 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:37,548 INFO L93 Difference]: Finished difference Result 668 states and 936 transitions. [2025-03-08 08:46:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:37,548 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-08 08:46:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:37,549 INFO L225 Difference]: With dead ends: 668 [2025-03-08 08:46:37,549 INFO L226 Difference]: Without dead ends: 419 [2025-03-08 08:46:37,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:37,550 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 473 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:37,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1065 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-08 08:46:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 339. [2025-03-08 08:46:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.378698224852071) internal successors, (466), 338 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-03-08 08:46:37,554 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 90 [2025-03-08 08:46:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:37,555 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-03-08 08:46:37,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-03-08 08:46:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 08:46:37,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:37,555 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] [2025-03-08 08:46:37,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 08:46:37,555 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:37,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash 214953371, now seen corresponding path program 1 times [2025-03-08 08:46:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:37,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402327327] [2025-03-08 08:46:37,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:37,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 08:46:37,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 08:46:37,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:37,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402327327] [2025-03-08 08:46:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402327327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:38,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:38,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-08 08:46:38,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114936335] [2025-03-08 08:46:38,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:38,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 08:46:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:38,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 08:46:38,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2025-03-08 08:46:38,457 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:39,051 INFO L93 Difference]: Finished difference Result 634 states and 887 transitions. [2025-03-08 08:46:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 08:46:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-08 08:46:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:39,052 INFO L225 Difference]: With dead ends: 634 [2025-03-08 08:46:39,052 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 08:46:39,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2025-03-08 08:46:39,053 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:39,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3295 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 08:46:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 08:46:39,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2025-03-08 08:46:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.3810810810810812) internal successors, (511), 370 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 511 transitions. [2025-03-08 08:46:39,057 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 511 transitions. Word has length 90 [2025-03-08 08:46:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:39,057 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 511 transitions. [2025-03-08 08:46:39,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 511 transitions. [2025-03-08 08:46:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 08:46:39,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:39,058 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] [2025-03-08 08:46:39,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 08:46:39,058 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:39,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 758261488, now seen corresponding path program 1 times [2025-03-08 08:46:39,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:39,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815217486] [2025-03-08 08:46:39,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:39,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:39,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 08:46:39,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 08:46:39,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:39,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815217486] [2025-03-08 08:46:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815217486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:46:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655850316] [2025-03-08 08:46:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:39,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:46:39,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:39,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:46:39,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:46:39,444 INFO L87 Difference]: Start difference. First operand 371 states and 511 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:39,531 INFO L93 Difference]: Finished difference Result 750 states and 1044 transitions. [2025-03-08 08:46:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:46:39,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-08 08:46:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:39,532 INFO L225 Difference]: With dead ends: 750 [2025-03-08 08:46:39,532 INFO L226 Difference]: Without dead ends: 424 [2025-03-08 08:46:39,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-08 08:46:39,533 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 334 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:39,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 499 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-08 08:46:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 347. [2025-03-08 08:46:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.3786127167630058) internal successors, (477), 346 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 477 transitions. [2025-03-08 08:46:39,537 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 477 transitions. Word has length 90 [2025-03-08 08:46:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:39,537 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 477 transitions. [2025-03-08 08:46:39,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 477 transitions. [2025-03-08 08:46:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 08:46:39,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:39,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:46:39,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 08:46:39,538 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:39,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1006433885, now seen corresponding path program 1 times [2025-03-08 08:46:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218378891] [2025-03-08 08:46:39,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:39,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 08:46:39,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 08:46:39,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:39,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:40,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:40,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218378891] [2025-03-08 08:46:40,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218378891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:40,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:40,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:40,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186050292] [2025-03-08 08:46:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:40,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:40,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:40,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:40,055 INFO L87 Difference]: Start difference. First operand 347 states and 477 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:40,231 INFO L93 Difference]: Finished difference Result 710 states and 994 transitions. [2025-03-08 08:46:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:40,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-08 08:46:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:40,232 INFO L225 Difference]: With dead ends: 710 [2025-03-08 08:46:40,232 INFO L226 Difference]: Without dead ends: 432 [2025-03-08 08:46:40,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:40,233 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 433 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:40,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1056 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-08 08:46:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 360. [2025-03-08 08:46:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.3788300835654597) internal successors, (495), 359 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 495 transitions. [2025-03-08 08:46:40,237 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 495 transitions. Word has length 91 [2025-03-08 08:46:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:40,237 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 495 transitions. [2025-03-08 08:46:40,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 495 transitions. [2025-03-08 08:46:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 08:46:40,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:40,238 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] [2025-03-08 08:46:40,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 08:46:40,238 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:40,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1392573117, now seen corresponding path program 1 times [2025-03-08 08:46:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:40,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657643327] [2025-03-08 08:46:40,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:40,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 08:46:40,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 08:46:40,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:40,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657643327] [2025-03-08 08:46:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657643327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:41,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:41,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-08 08:46:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121413434] [2025-03-08 08:46:41,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:41,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 08:46:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:41,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 08:46:41,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2025-03-08 08:46:41,131 INFO L87 Difference]: Start difference. First operand 360 states and 495 transitions. Second operand has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:41,877 INFO L93 Difference]: Finished difference Result 664 states and 929 transitions. [2025-03-08 08:46:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 08:46:41,877 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-08 08:46:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:41,878 INFO L225 Difference]: With dead ends: 664 [2025-03-08 08:46:41,878 INFO L226 Difference]: Without dead ends: 373 [2025-03-08 08:46:41,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2025-03-08 08:46:41,879 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 28 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:41,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3673 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 08:46:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-08 08:46:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2025-03-08 08:46:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.3783783783783783) internal successors, (510), 370 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 510 transitions. [2025-03-08 08:46:41,884 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 510 transitions. Word has length 91 [2025-03-08 08:46:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:41,884 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 510 transitions. [2025-03-08 08:46:41,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 510 transitions. [2025-03-08 08:46:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 08:46:41,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:41,885 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] [2025-03-08 08:46:41,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 08:46:41,885 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:41,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2028781547, now seen corresponding path program 1 times [2025-03-08 08:46:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:41,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957458913] [2025-03-08 08:46:41,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:41,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 08:46:41,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 08:46:41,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:41,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:42,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:42,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957458913] [2025-03-08 08:46:42,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957458913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:42,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:42,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:46:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636173724] [2025-03-08 08:46:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:42,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:46:42,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:42,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:46:42,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:42,266 INFO L87 Difference]: Start difference. First operand 371 states and 510 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:42,375 INFO L93 Difference]: Finished difference Result 681 states and 952 transitions. [2025-03-08 08:46:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:46:42,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-08 08:46:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:42,376 INFO L225 Difference]: With dead ends: 681 [2025-03-08 08:46:42,376 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 08:46:42,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:42,377 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:42,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1228 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 08:46:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2025-03-08 08:46:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.3756613756613756) internal successors, (520), 378 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2025-03-08 08:46:42,381 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 91 [2025-03-08 08:46:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:42,381 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2025-03-08 08:46:42,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2025-03-08 08:46:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 08:46:42,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:42,382 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] [2025-03-08 08:46:42,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 08:46:42,382 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:42,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:42,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1894104470, now seen corresponding path program 1 times [2025-03-08 08:46:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400332029] [2025-03-08 08:46:42,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:42,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 08:46:42,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 08:46:42,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:42,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:42,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-03-08 08:46:42,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:42,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400332029] [2025-03-08 08:46:42,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400332029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:42,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403863210] [2025-03-08 08:46:42,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:42,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:42,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:42,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:42,824 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:43,006 INFO L93 Difference]: Finished difference Result 752 states and 1050 transitions. [2025-03-08 08:46:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-08 08:46:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:43,007 INFO L225 Difference]: With dead ends: 752 [2025-03-08 08:46:43,007 INFO L226 Difference]: Without dead ends: 456 [2025-03-08 08:46:43,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:43,008 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 423 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:43,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1055 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:46:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-08 08:46:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 392. [2025-03-08 08:46:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.3759590792838874) internal successors, (538), 391 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 538 transitions. [2025-03-08 08:46:43,012 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 538 transitions. Word has length 92 [2025-03-08 08:46:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:43,012 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 538 transitions. [2025-03-08 08:46:43,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 538 transitions. [2025-03-08 08:46:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 08:46:43,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:43,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:46:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 08:46:43,012 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -869315251, now seen corresponding path program 1 times [2025-03-08 08:46:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745038844] [2025-03-08 08:46:43,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:43,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 08:46:43,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 08:46:43,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745038844] [2025-03-08 08:46:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745038844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-08 08:46:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100015512] [2025-03-08 08:46:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 08:46:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:43,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 08:46:43,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2025-03-08 08:46:43,922 INFO L87 Difference]: Start difference. First operand 392 states and 538 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:44,801 INFO L93 Difference]: Finished difference Result 721 states and 1007 transitions. [2025-03-08 08:46:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 08:46:44,801 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-08 08:46:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:44,802 INFO L225 Difference]: With dead ends: 721 [2025-03-08 08:46:44,802 INFO L226 Difference]: Without dead ends: 412 [2025-03-08 08:46:44,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2025-03-08 08:46:44,804 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 33 mSDsluCounter, 3754 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:44,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3881 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 08:46:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-08 08:46:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2025-03-08 08:46:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.3765281173594133) internal successors, (563), 409 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 563 transitions. [2025-03-08 08:46:44,808 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 563 transitions. Word has length 92 [2025-03-08 08:46:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:44,808 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 563 transitions. [2025-03-08 08:46:44,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 563 transitions. [2025-03-08 08:46:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 08:46:44,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:44,809 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] [2025-03-08 08:46:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 08:46:44,809 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:44,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1544869666, now seen corresponding path program 1 times [2025-03-08 08:46:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768288220] [2025-03-08 08:46:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:44,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 08:46:44,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 08:46:44,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:44,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768288220] [2025-03-08 08:46:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768288220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:45,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:45,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057505435] [2025-03-08 08:46:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:45,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:45,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:45,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:45,311 INFO L87 Difference]: Start difference. First operand 410 states and 563 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:45,448 INFO L93 Difference]: Finished difference Result 748 states and 1044 transitions. [2025-03-08 08:46:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:45,449 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-08 08:46:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:45,450 INFO L225 Difference]: With dead ends: 748 [2025-03-08 08:46:45,450 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 08:46:45,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:45,451 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:45,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1228 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 08:46:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2025-03-08 08:46:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3738095238095238) internal successors, (577), 420 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 577 transitions. [2025-03-08 08:46:45,454 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 577 transitions. Word has length 92 [2025-03-08 08:46:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:45,454 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 577 transitions. [2025-03-08 08:46:45,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 577 transitions. [2025-03-08 08:46:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 08:46:45,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:45,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] [2025-03-08 08:46:45,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 08:46:45,455 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:45,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1733261465, now seen corresponding path program 1 times [2025-03-08 08:46:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:45,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972271399] [2025-03-08 08:46:45,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:45,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 08:46:45,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 08:46:45,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:45,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:46,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:46,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972271399] [2025-03-08 08:46:46,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972271399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:46,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:46,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-03-08 08:46:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080608275] [2025-03-08 08:46:46,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:46,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 08:46:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:46,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 08:46:46,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1330, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 08:46:46,930 INFO L87 Difference]: Start difference. First operand 421 states and 577 transitions. Second operand has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:49,438 INFO L93 Difference]: Finished difference Result 837 states and 1166 transitions. [2025-03-08 08:46:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-08 08:46:49,438 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 08:46:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:49,439 INFO L225 Difference]: With dead ends: 837 [2025-03-08 08:46:49,439 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 08:46:49,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=426, Invalid=10704, Unknown=0, NotChecked=0, Total=11130 [2025-03-08 08:46:49,442 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 403 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 4007 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 5020 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:49,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 5020 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4007 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 08:46:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 08:46:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 471. [2025-03-08 08:46:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.376595744680851) internal successors, (647), 470 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 647 transitions. [2025-03-08 08:46:49,446 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 647 transitions. Word has length 93 [2025-03-08 08:46:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:49,447 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 647 transitions. [2025-03-08 08:46:49,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 647 transitions. [2025-03-08 08:46:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 08:46:49,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:49,447 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] [2025-03-08 08:46:49,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 08:46:49,447 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:49,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1867215309, now seen corresponding path program 1 times [2025-03-08 08:46:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:49,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420558659] [2025-03-08 08:46:49,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:49,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 08:46:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 08:46:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420558659] [2025-03-08 08:46:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420558659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:50,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:50,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459175766] [2025-03-08 08:46:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:50,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:50,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:50,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:50,017 INFO L87 Difference]: Start difference. First operand 471 states and 647 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:50,181 INFO L93 Difference]: Finished difference Result 875 states and 1223 transitions. [2025-03-08 08:46:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:50,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 08:46:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:50,183 INFO L225 Difference]: With dead ends: 875 [2025-03-08 08:46:50,183 INFO L226 Difference]: Without dead ends: 513 [2025-03-08 08:46:50,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:50,184 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 357 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:50,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 956 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-08 08:46:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 484. [2025-03-08 08:46:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3768115942028984) internal successors, (665), 483 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 665 transitions. [2025-03-08 08:46:50,189 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 665 transitions. Word has length 93 [2025-03-08 08:46:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:50,189 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 665 transitions. [2025-03-08 08:46:50,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 665 transitions. [2025-03-08 08:46:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 08:46:50,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:50,190 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] [2025-03-08 08:46:50,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 08:46:50,190 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:50,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1771647382, now seen corresponding path program 1 times [2025-03-08 08:46:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:50,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414570724] [2025-03-08 08:46:50,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:50,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:50,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 08:46:50,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 08:46:50,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:50,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414570724] [2025-03-08 08:46:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414570724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:50,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:50,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:46:50,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518572467] [2025-03-08 08:46:50,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:50,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:46:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:50,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:46:50,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:50,712 INFO L87 Difference]: Start difference. First operand 484 states and 665 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:50,824 INFO L93 Difference]: Finished difference Result 871 states and 1215 transitions. [2025-03-08 08:46:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:46:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 08:46:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:50,826 INFO L225 Difference]: With dead ends: 871 [2025-03-08 08:46:50,826 INFO L226 Difference]: Without dead ends: 497 [2025-03-08 08:46:50,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:50,827 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:50,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1228 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-08 08:46:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2025-03-08 08:46:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.3755102040816327) internal successors, (674), 490 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 674 transitions. [2025-03-08 08:46:50,832 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 674 transitions. Word has length 93 [2025-03-08 08:46:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:50,832 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 674 transitions. [2025-03-08 08:46:50,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 674 transitions. [2025-03-08 08:46:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 08:46:50,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:50,833 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] [2025-03-08 08:46:50,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 08:46:50,833 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -850595105, now seen corresponding path program 1 times [2025-03-08 08:46:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:50,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457764934] [2025-03-08 08:46:50,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:50,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 08:46:50,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 08:46:50,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:50,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:51,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457764934] [2025-03-08 08:46:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457764934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:51,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:51,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416798725] [2025-03-08 08:46:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:51,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:51,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:51,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:51,120 INFO L87 Difference]: Start difference. First operand 491 states and 674 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:51,164 INFO L93 Difference]: Finished difference Result 899 states and 1249 transitions. [2025-03-08 08:46:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:51,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-08 08:46:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:51,165 INFO L225 Difference]: With dead ends: 899 [2025-03-08 08:46:51,165 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 08:46:51,166 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-03-08 08:46:51,166 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:51,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:46:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 08:46:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-08 08:46:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.366167023554604) internal successors, (638), 467 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 638 transitions. [2025-03-08 08:46:51,170 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 638 transitions. Word has length 93 [2025-03-08 08:46:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:51,170 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 638 transitions. [2025-03-08 08:46:51,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 638 transitions. [2025-03-08 08:46:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 08:46:51,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:51,170 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] [2025-03-08 08:46:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 08:46:51,171 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:51,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash 762360596, now seen corresponding path program 1 times [2025-03-08 08:46:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422059992] [2025-03-08 08:46:51,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:51,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 08:46:51,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 08:46:51,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:51,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422059992] [2025-03-08 08:46:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422059992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444884489] [2025-03-08 08:46:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:51,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:51,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:51,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:51,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:51,747 INFO L87 Difference]: Start difference. First operand 468 states and 638 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:51,922 INFO L93 Difference]: Finished difference Result 865 states and 1200 transitions. [2025-03-08 08:46:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:51,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-08 08:46:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:51,923 INFO L225 Difference]: With dead ends: 865 [2025-03-08 08:46:51,923 INFO L226 Difference]: Without dead ends: 502 [2025-03-08 08:46:51,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:51,924 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 329 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:51,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1103 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-08 08:46:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 481. [2025-03-08 08:46:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.3666666666666667) internal successors, (656), 480 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 656 transitions. [2025-03-08 08:46:51,931 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 656 transitions. Word has length 94 [2025-03-08 08:46:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:51,931 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 656 transitions. [2025-03-08 08:46:51,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 656 transitions. [2025-03-08 08:46:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 08:46:51,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:51,932 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] [2025-03-08 08:46:51,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 08:46:51,932 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:51,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -692899293, now seen corresponding path program 1 times [2025-03-08 08:46:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835083761] [2025-03-08 08:46:51,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:51,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:51,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 08:46:52,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 08:46:52,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:52,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835083761] [2025-03-08 08:46:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835083761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:53,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:53,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-03-08 08:46:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38595103] [2025-03-08 08:46:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:53,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 08:46:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:53,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 08:46:53,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 08:46:53,348 INFO L87 Difference]: Start difference. First operand 481 states and 656 transitions. Second operand has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:54,817 INFO L93 Difference]: Finished difference Result 891 states and 1236 transitions. [2025-03-08 08:46:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 08:46:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-08 08:46:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:54,819 INFO L225 Difference]: With dead ends: 891 [2025-03-08 08:46:54,819 INFO L226 Difference]: Without dead ends: 515 [2025-03-08 08:46:54,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 08:46:54,820 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 41 mSDsluCounter, 3928 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:54,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4042 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3722 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 08:46:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-08 08:46:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2025-03-08 08:46:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.369140625) internal successors, (701), 512 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 701 transitions. [2025-03-08 08:46:54,828 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 701 transitions. Word has length 94 [2025-03-08 08:46:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:54,828 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 701 transitions. [2025-03-08 08:46:54,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 701 transitions. [2025-03-08 08:46:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 08:46:54,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:54,829 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] [2025-03-08 08:46:54,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 08:46:54,829 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash -590062410, now seen corresponding path program 1 times [2025-03-08 08:46:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042923330] [2025-03-08 08:46:54,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:54,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:54,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 08:46:54,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 08:46:54,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:54,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:55,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042923330] [2025-03-08 08:46:55,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042923330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:55,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:55,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865700869] [2025-03-08 08:46:55,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:55,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:55,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:55,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:55,224 INFO L87 Difference]: Start difference. First operand 513 states and 701 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:55,272 INFO L93 Difference]: Finished difference Result 925 states and 1282 transitions. [2025-03-08 08:46:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-08 08:46:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:55,273 INFO L225 Difference]: With dead ends: 925 [2025-03-08 08:46:55,273 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 08:46:55,274 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-03-08 08:46:55,274 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:55,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:46:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 08:46:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-08 08:46:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.3654223968565815) internal successors, (695), 509 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 695 transitions. [2025-03-08 08:46:55,280 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 695 transitions. Word has length 94 [2025-03-08 08:46:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:55,282 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 695 transitions. [2025-03-08 08:46:55,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 695 transitions. [2025-03-08 08:46:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 08:46:55,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:55,283 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] [2025-03-08 08:46:55,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 08:46:55,283 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash -788677909, now seen corresponding path program 1 times [2025-03-08 08:46:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232905995] [2025-03-08 08:46:55,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:55,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 08:46:55,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 08:46:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232905995] [2025-03-08 08:46:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232905995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:46:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592746061] [2025-03-08 08:46:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:46:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:46:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:46:55,624 INFO L87 Difference]: Start difference. First operand 510 states and 695 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:55,706 INFO L93 Difference]: Finished difference Result 988 states and 1361 transitions. [2025-03-08 08:46:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:46:55,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-08 08:46:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:55,708 INFO L225 Difference]: With dead ends: 988 [2025-03-08 08:46:55,708 INFO L226 Difference]: Without dead ends: 543 [2025-03-08 08:46:55,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-08 08:46:55,709 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 382 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:55,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 492 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-08 08:46:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 498. [2025-03-08 08:46:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.364185110663984) internal successors, (678), 497 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 678 transitions. [2025-03-08 08:46:55,713 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 678 transitions. Word has length 94 [2025-03-08 08:46:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:55,713 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 678 transitions. [2025-03-08 08:46:55,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 678 transitions. [2025-03-08 08:46:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 08:46:55,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:55,714 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] [2025-03-08 08:46:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 08:46:55,714 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1708512247, now seen corresponding path program 1 times [2025-03-08 08:46:55,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:55,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023361636] [2025-03-08 08:46:55,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:55,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 08:46:55,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 08:46:55,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:55,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:56,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-03-08 08:46:56,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023361636] [2025-03-08 08:46:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023361636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:46:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621105268] [2025-03-08 08:46:56,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:56,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:46:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:56,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:46:56,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:46:56,207 INFO L87 Difference]: Start difference. First operand 498 states and 678 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:56,364 INFO L93 Difference]: Finished difference Result 915 states and 1267 transitions. [2025-03-08 08:46:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:46:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 08:46:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:56,366 INFO L225 Difference]: With dead ends: 915 [2025-03-08 08:46:56,366 INFO L226 Difference]: Without dead ends: 524 [2025-03-08 08:46:56,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:46:56,367 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 255 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:56,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 925 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-08 08:46:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 511. [2025-03-08 08:46:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 696 transitions. [2025-03-08 08:46:56,371 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 696 transitions. Word has length 95 [2025-03-08 08:46:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:56,371 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 696 transitions. [2025-03-08 08:46:56,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 696 transitions. [2025-03-08 08:46:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 08:46:56,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:56,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:46:56,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 08:46:56,371 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:56,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash -24104757, now seen corresponding path program 1 times [2025-03-08 08:46:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:56,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963826045] [2025-03-08 08:46:56,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:56,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:56,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 08:46:56,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 08:46:56,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:56,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963826045] [2025-03-08 08:46:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963826045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2025-03-08 08:46:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368130052] [2025-03-08 08:46:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 08:46:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:57,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 08:46:57,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 08:46:57,667 INFO L87 Difference]: Start difference. First operand 511 states and 696 transitions. Second operand has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:59,003 INFO L93 Difference]: Finished difference Result 930 states and 1288 transitions. [2025-03-08 08:46:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 08:46:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 08:46:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:59,005 INFO L225 Difference]: With dead ends: 930 [2025-03-08 08:46:59,005 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 08:46:59,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 08:46:59,006 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 44 mSDsluCounter, 4102 mSDsCounter, 0 mSdLazyCounter, 4337 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4209 SdHoareTripleChecker+Invalid, 4370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:59,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4209 Invalid, 4370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4337 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 08:46:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 08:46:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2025-03-08 08:46:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.3652007648183557) internal successors, (714), 523 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2025-03-08 08:46:59,012 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 95 [2025-03-08 08:46:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:59,012 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2025-03-08 08:46:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2025-03-08 08:46:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 08:46:59,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:59,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:46:59,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 08:46:59,012 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2027193756, now seen corresponding path program 1 times [2025-03-08 08:46:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415633360] [2025-03-08 08:46:59,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:59,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 08:46:59,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 08:46:59,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:59,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415633360] [2025-03-08 08:46:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415633360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:46:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486784017] [2025-03-08 08:46:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:59,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:46:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:59,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:46:59,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:59,471 INFO L87 Difference]: Start difference. First operand 524 states and 714 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:59,583 INFO L93 Difference]: Finished difference Result 952 states and 1318 transitions. [2025-03-08 08:46:59,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:46:59,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 08:46:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:59,584 INFO L225 Difference]: With dead ends: 952 [2025-03-08 08:46:59,584 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 08:46:59,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:46:59,585 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 3 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:59,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1214 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:46:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 08:46:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 535. [2025-03-08 08:46:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.3632958801498127) internal successors, (728), 534 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 728 transitions. [2025-03-08 08:46:59,589 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 728 transitions. Word has length 95 [2025-03-08 08:46:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 728 transitions. [2025-03-08 08:46:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 728 transitions. [2025-03-08 08:46:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 08:46:59,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:59,590 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] [2025-03-08 08:46:59,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 08:46:59,590 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:59,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:59,590 INFO L85 PathProgramCache]: Analyzing trace with hash 802498464, now seen corresponding path program 1 times [2025-03-08 08:46:59,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:59,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8077516] [2025-03-08 08:46:59,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:59,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:59,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 08:46:59,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 08:46:59,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:46:59,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:46:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:46:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:46:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8077516] [2025-03-08 08:46:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8077516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:46:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:46:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:46:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769809718] [2025-03-08 08:46:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:46:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:46:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:46:59,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:46:59,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:46:59,886 INFO L87 Difference]: Start difference. First operand 535 states and 728 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:46:59,922 INFO L93 Difference]: Finished difference Result 969 states and 1337 transitions. [2025-03-08 08:46:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:46:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 08:46:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:46:59,923 INFO L225 Difference]: With dead ends: 969 [2025-03-08 08:46:59,923 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 08:46:59,924 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-03-08 08:46:59,924 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:46:59,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:46:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 08:46:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2025-03-08 08:46:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.3581488933601609) internal successors, (675), 497 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 675 transitions. [2025-03-08 08:46:59,928 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 675 transitions. Word has length 95 [2025-03-08 08:46:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:46:59,928 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 675 transitions. [2025-03-08 08:46:59,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:46:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 675 transitions. [2025-03-08 08:46:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 08:46:59,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:46:59,929 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] [2025-03-08 08:46:59,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 08:46:59,929 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:46:59,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:46:59,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1530184258, now seen corresponding path program 1 times [2025-03-08 08:46:59,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:46:59,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045398471] [2025-03-08 08:46:59,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:46:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:46:59,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 08:47:00,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 08:47:00,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:00,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:47:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:47:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:47:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045398471] [2025-03-08 08:47:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045398471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:47:00,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:47:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:47:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248109395] [2025-03-08 08:47:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:47:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:47:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:47:00,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:47:00,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:47:00,563 INFO L87 Difference]: Start difference. First operand 498 states and 675 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:47:00,759 INFO L93 Difference]: Finished difference Result 911 states and 1257 transitions. [2025-03-08 08:47:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:47:00,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 08:47:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:47:00,761 INFO L225 Difference]: With dead ends: 911 [2025-03-08 08:47:00,761 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 08:47:00,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:47:00,762 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 255 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:47:00,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1076 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:47:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 08:47:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 511. [2025-03-08 08:47:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 694 transitions. [2025-03-08 08:47:00,766 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 694 transitions. Word has length 96 [2025-03-08 08:47:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:47:00,766 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 694 transitions. [2025-03-08 08:47:00,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 694 transitions. [2025-03-08 08:47:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 08:47:00,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:47:00,766 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] [2025-03-08 08:47:00,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 08:47:00,766 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:47:00,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:47:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307395, now seen corresponding path program 1 times [2025-03-08 08:47:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:47:00,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119503416] [2025-03-08 08:47:00,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:47:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:47:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 08:47:00,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 08:47:00,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:00,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:47:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:47:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:47:02,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119503416] [2025-03-08 08:47:02,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119503416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:47:02,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:47:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2025-03-08 08:47:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471605589] [2025-03-08 08:47:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:47:02,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 08:47:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:47:02,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 08:47:02,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 08:47:02,404 INFO L87 Difference]: Start difference. First operand 511 states and 694 transitions. Second operand has 51 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:47:04,285 INFO L93 Difference]: Finished difference Result 944 states and 1306 transitions. [2025-03-08 08:47:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-08 08:47:04,285 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 08:47:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:47:04,286 INFO L225 Difference]: With dead ends: 944 [2025-03-08 08:47:04,286 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 08:47:04,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 08:47:04,288 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 258 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 6141 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 4176 SdHoareTripleChecker+Invalid, 6187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 08:47:04,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 4176 Invalid, 6187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6141 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 08:47:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 08:47:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 545. [2025-03-08 08:47:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.3676470588235294) internal successors, (744), 544 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 744 transitions. [2025-03-08 08:47:04,292 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 744 transitions. Word has length 96 [2025-03-08 08:47:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:47:04,292 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 744 transitions. [2025-03-08 08:47:04,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 744 transitions. [2025-03-08 08:47:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 08:47:04,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:47:04,293 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] [2025-03-08 08:47:04,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 08:47:04,293 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:47:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:47:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -997070828, now seen corresponding path program 1 times [2025-03-08 08:47:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:47:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160706758] [2025-03-08 08:47:04,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:47:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:47:04,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 08:47:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 08:47:04,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:04,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:47:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:47:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:47:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160706758] [2025-03-08 08:47:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160706758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:47:05,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:47:05,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2025-03-08 08:47:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752423004] [2025-03-08 08:47:05,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:47:05,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 08:47:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:47:05,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 08:47:05,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 08:47:05,835 INFO L87 Difference]: Start difference. First operand 545 states and 744 transitions. Second operand has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:47:07,310 INFO L93 Difference]: Finished difference Result 993 states and 1379 transitions. [2025-03-08 08:47:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 08:47:07,310 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 08:47:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:47:07,312 INFO L225 Difference]: With dead ends: 993 [2025-03-08 08:47:07,312 INFO L226 Difference]: Without dead ends: 551 [2025-03-08 08:47:07,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 08:47:07,313 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 4877 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4224 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:47:07,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4224 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4877 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 08:47:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-08 08:47:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-08 08:47:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.3672727272727272) internal successors, (752), 550 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 752 transitions. [2025-03-08 08:47:07,317 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 752 transitions. Word has length 96 [2025-03-08 08:47:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:47:07,317 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 752 transitions. [2025-03-08 08:47:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 752 transitions. [2025-03-08 08:47:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 08:47:07,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:47:07,318 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] [2025-03-08 08:47:07,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 08:47:07,318 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:47:07,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:47:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1060775028, now seen corresponding path program 1 times [2025-03-08 08:47:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:47:07,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15559636] [2025-03-08 08:47:07,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:47:07,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:47:07,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 08:47:07,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 08:47:07,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:07,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:47:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:47:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:47:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15559636] [2025-03-08 08:47:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15559636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:47:07,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:47:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:47:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99551615] [2025-03-08 08:47:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:47:07,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:47:07,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:47:07,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:47:07,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:47:07,617 INFO L87 Difference]: Start difference. First operand 551 states and 752 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:47:07,649 INFO L93 Difference]: Finished difference Result 1002 states and 1390 transitions. [2025-03-08 08:47:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:47:07,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 08:47:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:47:07,651 INFO L225 Difference]: With dead ends: 1002 [2025-03-08 08:47:07,651 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 08:47:07,651 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-03-08 08:47:07,651 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:47:07,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:47:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 08:47:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-08 08:47:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.3626373626373627) internal successors, (744), 546 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 744 transitions. [2025-03-08 08:47:07,656 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 744 transitions. Word has length 96 [2025-03-08 08:47:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:47:07,656 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 744 transitions. [2025-03-08 08:47:07,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 744 transitions. [2025-03-08 08:47:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 08:47:07,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:47:07,656 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] [2025-03-08 08:47:07,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 08:47:07,656 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:47:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:47:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 755728114, now seen corresponding path program 1 times [2025-03-08 08:47:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:47:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076031186] [2025-03-08 08:47:07,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:47:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:47:07,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 08:47:07,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 08:47:07,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:07,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:47:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:47:08,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:47:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076031186] [2025-03-08 08:47:08,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076031186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:47:08,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:47:08,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:47:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770434830] [2025-03-08 08:47:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:47:08,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:47:08,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:47:08,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:47:08,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:47:08,048 INFO L87 Difference]: Start difference. First operand 547 states and 744 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:47:08,140 INFO L93 Difference]: Finished difference Result 997 states and 1380 transitions. [2025-03-08 08:47:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:47:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 08:47:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:47:08,142 INFO L225 Difference]: With dead ends: 997 [2025-03-08 08:47:08,142 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 08:47:08,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:47:08,143 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 3 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:47:08,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1034 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:47:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 08:47:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 560. [2025-03-08 08:47:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3613595706618962) internal successors, (761), 559 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 761 transitions. [2025-03-08 08:47:08,148 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 761 transitions. Word has length 97 [2025-03-08 08:47:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:47:08,148 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 761 transitions. [2025-03-08 08:47:08,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 761 transitions. [2025-03-08 08:47:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 08:47:08,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:47:08,148 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] [2025-03-08 08:47:08,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 08:47:08,149 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:47:08,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:47:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2087727137, now seen corresponding path program 1 times [2025-03-08 08:47:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:47:08,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614333560] [2025-03-08 08:47:08,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:47:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:47:08,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 08:47:08,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 08:47:08,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:08,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:47:08,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 08:47:08,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 08:47:08,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 08:47:08,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:08,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:47:08,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 08:47:08,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 08:47:08,511 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 08:47:08,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 08:47:08,514 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:47:08,547 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 08:47:08,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 08:47:08,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 08:47:08 BoogieIcfgContainer [2025-03-08 08:47:08,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 08:47:08,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 08:47:08,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 08:47:08,565 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 08:47:08,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:46:13" (3/4) ... [2025-03-08 08:47:08,567 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 08:47:08,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 08:47:08,568 INFO L158 Benchmark]: Toolchain (without parser) took 55882.96ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 113.7MB in the beginning and 459.4MB in the end (delta: -345.8MB). Peak memory consumption was 483.5MB. Max. memory is 16.1GB. [2025-03-08 08:47:08,568 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:47:08,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.13ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 95.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 08:47:08,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.33ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 82.4MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 08:47:08,568 INFO L158 Benchmark]: Boogie Preprocessor took 94.11ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 74.9MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:47:08,568 INFO L158 Benchmark]: IcfgBuilder took 824.31ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 58.9MB in the end (delta: 16.0MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2025-03-08 08:47:08,568 INFO L158 Benchmark]: TraceAbstraction took 54651.04ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 58.2MB in the beginning and 459.6MB in the end (delta: -401.3MB). Peak memory consumption was 430.3MB. Max. memory is 16.1GB. [2025-03-08 08:47:08,569 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 973.1MB. Free memory was 459.6MB in the beginning and 459.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:47:08,569 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.13ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 95.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.33ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 82.4MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.11ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 74.9MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 824.31ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 58.9MB in the end (delta: 16.0MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54651.04ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 58.2MB in the beginning and 459.6MB in the end (delta: -401.3MB). Peak memory consumption was 430.3MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 973.1MB. Free memory was 459.6MB in the beginning and 459.4MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 248. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_78 = 1; [L35] SORT_1 input_2; [L37] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L37] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L38] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L39] SORT_3 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, var_4=0, var_78=1] [L40] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_4; [L45] state_8 = init_9_arg_1 [L46] SORT_3 init_26_arg_1 = var_4; [L47] state_25 = init_26_arg_1 [L48] SORT_3 init_44_arg_1 = var_4; [L49] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L52] input_2 = __VERIFIER_nondet_uchar() [L55] SORT_3 var_7_arg_0 = state_5; [L56] SORT_3 var_7_arg_1 = var_4; [L57] SORT_1 var_7 = var_7_arg_0 != var_7_arg_1; [L58] SORT_3 var_10_arg_0 = state_8; [L59] SORT_3 var_10_arg_1 = var_4; [L60] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L61] SORT_1 var_11_arg_0 = var_7; [L62] SORT_1 var_11_arg_1 = var_10; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11_arg_0=0, var_11_arg_1=1, var_4=0, var_78=1] [L63] EXPR var_11_arg_0 | var_11_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L63] SORT_1 var_11 = var_11_arg_0 | var_11_arg_1; [L64] SORT_3 var_12_arg_0 = state_5; [L65] SORT_3 var_12_arg_1 = var_4; [L66] SORT_1 var_12 = var_12_arg_0 != var_12_arg_1; [L67] SORT_3 var_13_arg_0 = state_8; [L68] SORT_3 var_13_arg_1 = var_4; [L69] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L70] SORT_1 var_14_arg_0 = var_12; [L71] SORT_1 var_14_arg_1 = var_13; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_14_arg_0=0, var_14_arg_1=1, var_4=0, var_78=1] [L72] EXPR var_14_arg_0 | var_14_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_4=0, var_78=1] [L72] SORT_1 var_14 = var_14_arg_0 | var_14_arg_1; [L73] SORT_1 var_15_arg_0 = var_11; [L74] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15_arg_0=1, var_15_arg_1=1, var_4=0, var_78=1] [L75] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L75] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L76] SORT_3 var_16_arg_0 = state_5; [L77] SORT_3 var_16_arg_1 = var_4; [L78] SORT_1 var_16 = var_16_arg_0 != var_16_arg_1; [L79] SORT_3 var_17_arg_0 = state_8; [L80] SORT_3 var_17_arg_1 = var_4; [L81] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L82] SORT_1 var_18_arg_0 = var_16; [L83] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_18_arg_0=0, var_18_arg_1=1, var_4=0, var_78=1] [L84] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_4=0, var_78=1] [L84] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L85] SORT_1 var_19_arg_0 = var_15; [L86] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_78=1] [L87] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L87] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L88] SORT_3 var_20_arg_0 = state_5; [L89] SORT_3 var_20_arg_1 = var_4; [L90] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L91] SORT_3 var_21_arg_0 = state_8; [L92] SORT_3 var_21_arg_1 = var_4; [L93] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L94] SORT_1 var_22_arg_0 = var_20; [L95] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_22_arg_0=0, var_22_arg_1=1, var_4=0, var_78=1] [L96] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_4=0, var_78=1] [L96] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23_arg_0=1, var_23_arg_1=1, var_4=0, var_78=1] [L99] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L99] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L100] SORT_3 var_24_arg_0 = state_8; [L101] SORT_3 var_24_arg_1 = var_4; [L102] SORT_1 var_24 = var_24_arg_0 != var_24_arg_1; [L103] SORT_3 var_27_arg_0 = state_25; [L104] SORT_3 var_27_arg_1 = var_4; [L105] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L106] SORT_1 var_28_arg_0 = var_24; [L107] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_28_arg_0=0, var_28_arg_1=1, var_4=0, var_78=1] [L108] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_4=0, var_78=1] [L108] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L109] SORT_1 var_29_arg_0 = var_23; [L110] SORT_1 var_29_arg_1 = var_28; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29_arg_0=1, var_29_arg_1=1, var_4=0, var_78=1] [L111] EXPR var_29_arg_0 & var_29_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L111] SORT_1 var_29 = var_29_arg_0 & var_29_arg_1; [L112] SORT_3 var_30_arg_0 = state_8; [L113] SORT_3 var_30_arg_1 = var_4; [L114] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L115] SORT_3 var_31_arg_0 = state_25; [L116] SORT_3 var_31_arg_1 = var_4; [L117] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L118] SORT_1 var_32_arg_0 = var_30; [L119] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_32_arg_0=0, var_32_arg_1=1, var_4=0, var_78=1] [L120] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_4=0, var_78=1] [L120] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L121] SORT_1 var_33_arg_0 = var_29; [L122] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33_arg_0=1, var_33_arg_1=1, var_4=0, var_78=1] [L123] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L123] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L124] SORT_3 var_34_arg_0 = state_8; [L125] SORT_3 var_34_arg_1 = var_4; [L126] SORT_1 var_34 = var_34_arg_0 != var_34_arg_1; [L127] SORT_3 var_35_arg_0 = state_25; [L128] SORT_3 var_35_arg_1 = var_4; [L129] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L130] SORT_1 var_36_arg_0 = var_34; [L131] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_36_arg_0=0, var_36_arg_1=1, var_4=0, var_78=1] [L132] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_4=0, var_78=1] [L132] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L133] SORT_1 var_37_arg_0 = var_33; [L134] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37_arg_0=1, var_37_arg_1=1, var_4=0, var_78=1] [L135] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L135] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L136] SORT_3 var_38_arg_0 = state_8; [L137] SORT_3 var_38_arg_1 = var_4; [L138] SORT_1 var_38 = var_38_arg_0 != var_38_arg_1; [L139] SORT_3 var_39_arg_0 = state_25; [L140] SORT_3 var_39_arg_1 = var_4; [L141] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L142] SORT_1 var_40_arg_0 = var_38; [L143] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_40_arg_0=0, var_40_arg_1=1, var_4=0, var_78=1] [L144] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_4=0, var_78=1] [L144] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L145] SORT_1 var_41_arg_0 = var_37; [L146] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41_arg_0=1, var_41_arg_1=1, var_4=0, var_78=1] [L147] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L147] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L148] SORT_3 var_42_arg_0 = state_25; [L149] SORT_3 var_42_arg_1 = var_4; [L150] SORT_1 var_42 = var_42_arg_0 != var_42_arg_1; [L151] SORT_3 var_45_arg_0 = state_43; [L152] SORT_3 var_45_arg_1 = var_4; [L153] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L154] SORT_1 var_46_arg_0 = var_42; [L155] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_46_arg_0=0, var_46_arg_1=1, var_4=0, var_78=1] [L156] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_4=0, var_78=1] [L156] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L157] SORT_1 var_47_arg_0 = var_41; [L158] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47_arg_0=1, var_47_arg_1=1, var_4=0, var_78=1] [L159] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L159] SORT_1 var_47 = var_47_arg_0 & var_47_arg_1; [L160] SORT_3 var_48_arg_0 = state_25; [L161] SORT_3 var_48_arg_1 = var_4; [L162] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L163] SORT_3 var_49_arg_0 = state_43; [L164] SORT_3 var_49_arg_1 = var_4; [L165] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L166] SORT_1 var_50_arg_0 = var_48; [L167] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_50_arg_0=0, var_50_arg_1=1, var_78=1] [L168] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_78=1] [L168] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L169] SORT_1 var_51_arg_0 = var_47; [L170] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51_arg_0=1, var_51_arg_1=1, var_78=1] [L171] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L171] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L172] SORT_3 var_52_arg_0 = state_25; [L173] SORT_3 var_52_arg_1 = var_4; [L174] SORT_1 var_52 = var_52_arg_0 != var_52_arg_1; [L175] SORT_3 var_53_arg_0 = state_43; [L176] SORT_3 var_53_arg_1 = var_4; [L177] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L178] SORT_1 var_54_arg_0 = var_52; [L179] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_54_arg_0=0, var_54_arg_1=1, var_78=1] [L180] EXPR var_54_arg_0 | var_54_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_78=1] [L180] SORT_1 var_54 = var_54_arg_0 | var_54_arg_1; [L181] SORT_1 var_55_arg_0 = var_51; [L182] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55_arg_0=1, var_55_arg_1=1, var_78=1] [L183] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L183] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L184] SORT_3 var_56_arg_0 = state_25; [L185] SORT_3 var_56_arg_1 = var_4; [L186] SORT_1 var_56 = var_56_arg_0 != var_56_arg_1; [L187] SORT_3 var_57_arg_0 = state_43; [L188] SORT_3 var_57_arg_1 = var_4; [L189] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L190] SORT_1 var_58_arg_0 = var_56; [L191] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_58_arg_0=0, var_58_arg_1=1, var_78=1] [L192] EXPR var_58_arg_0 | var_58_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_78=1] [L192] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L193] SORT_1 var_59_arg_0 = var_55; [L194] SORT_1 var_59_arg_1 = var_58; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59_arg_0=1, var_59_arg_1=1, var_78=1] [L195] EXPR var_59_arg_0 & var_59_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L195] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L196] SORT_3 var_60_arg_0 = state_43; [L197] SORT_3 var_60_arg_1 = var_4; [L198] SORT_1 var_60 = var_60_arg_0 != var_60_arg_1; [L199] SORT_3 var_61_arg_0 = state_5; [L200] SORT_3 var_61_arg_1 = var_4; [L201] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L202] SORT_1 var_62_arg_0 = var_60; [L203] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_62_arg_0=0, var_62_arg_1=1, var_78=1] [L204] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_78=1] [L204] SORT_1 var_62 = var_62_arg_0 | var_62_arg_1; [L205] SORT_1 var_63_arg_0 = var_59; [L206] SORT_1 var_63_arg_1 = var_62; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63_arg_0=1, var_63_arg_1=1, var_78=1] [L207] EXPR var_63_arg_0 & var_63_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L207] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L208] SORT_3 var_64_arg_0 = state_43; [L209] SORT_3 var_64_arg_1 = var_4; [L210] SORT_1 var_64 = var_64_arg_0 != var_64_arg_1; [L211] SORT_3 var_65_arg_0 = state_5; [L212] SORT_3 var_65_arg_1 = var_4; [L213] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L214] SORT_1 var_66_arg_0 = var_64; [L215] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_66_arg_0=0, var_66_arg_1=1, var_78=1] [L216] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_78=1] [L216] SORT_1 var_66 = var_66_arg_0 | var_66_arg_1; [L217] SORT_1 var_67_arg_0 = var_63; [L218] SORT_1 var_67_arg_1 = var_66; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67_arg_0=1, var_67_arg_1=1, var_78=1] [L219] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L219] SORT_1 var_67 = var_67_arg_0 & var_67_arg_1; [L220] SORT_3 var_68_arg_0 = state_43; [L221] SORT_3 var_68_arg_1 = var_4; [L222] SORT_1 var_68 = var_68_arg_0 != var_68_arg_1; [L223] SORT_3 var_69_arg_0 = state_5; [L224] SORT_3 var_69_arg_1 = var_4; [L225] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L226] SORT_1 var_70_arg_0 = var_68; [L227] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_70_arg_0=0, var_70_arg_1=1, var_78=1] [L228] EXPR var_70_arg_0 | var_70_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_78=1] [L228] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L229] SORT_1 var_71_arg_0 = var_67; [L230] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_71_arg_0=1, var_71_arg_1=1, var_78=1] [L231] EXPR var_71_arg_0 & var_71_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L231] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L232] SORT_3 var_72_arg_0 = state_43; [L233] SORT_3 var_72_arg_1 = var_4; [L234] SORT_1 var_72 = var_72_arg_0 != var_72_arg_1; [L235] SORT_3 var_73_arg_0 = state_5; [L236] SORT_3 var_73_arg_1 = var_4; [L237] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L238] SORT_1 var_74_arg_0 = var_72; [L239] SORT_1 var_74_arg_1 = var_73; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_74_arg_0=0, var_74_arg_1=1, var_78=1] [L240] EXPR var_74_arg_0 | var_74_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_78=1] [L240] SORT_1 var_74 = var_74_arg_0 | var_74_arg_1; [L241] SORT_1 var_75_arg_0 = var_71; [L242] SORT_1 var_75_arg_1 = var_74; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_75_arg_0=1, var_75_arg_1=1, var_78=1] [L243] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L243] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L244] SORT_1 var_79_arg_0 = var_75; [L245] SORT_1 var_79 = ~var_79_arg_0; [L246] SORT_1 var_80_arg_0 = var_78; [L247] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1, var_80_arg_0=1, var_80_arg_1=-2] [L248] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L248] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L249] EXPR var_80 & mask_SORT_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L249] var_80 = var_80 & mask_SORT_1 [L250] SORT_1 bad_81_arg_0 = var_80; [L251] CALL __VERIFIER_assert(!(bad_81_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 158 locations, 233 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.6s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8802 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8802 mSDsluCounter, 79867 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71185 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46705 IncrementalHoareTripleChecker+Invalid, 46960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 8682 mSDtfsCounter, 46705 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=53, InterpolantAutomatonStates: 715, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 53 MinimizatonAttempts, 1626 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 4839 NumberOfCodeBlocks, 4839 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 4689 ConstructedInterpolants, 0 QuantifiedInterpolants, 17229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 08:47:08,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:47:10,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:47:10,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 08:47:10,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:47:10,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:47:10,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:47:10,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:47:10,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:47:10,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:47:10,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:47:10,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:47:10,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:47:10,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:47:10,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:47:10,583 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:47:10,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:47:10,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:47:10,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:47:10,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:47:10,585 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2025-03-08 08:47:10,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:47:10,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:47:10,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:47:10,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:47:10,861 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:47:10,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-08 08:47:12,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7fa18cf/c4f5a266387041a29bcbfb4686342162/FLAG770e20d17 [2025-03-08 08:47:12,196 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:47:12,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-08 08:47:12,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7fa18cf/c4f5a266387041a29bcbfb4686342162/FLAG770e20d17 [2025-03-08 08:47:12,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7fa18cf/c4f5a266387041a29bcbfb4686342162 [2025-03-08 08:47:12,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:47:12,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:47:12,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:47:12,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:47:12,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:47:12,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bab4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12, skipping insertion in model container [2025-03-08 08:47:12,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:47:12,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-08 08:47:12,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:47:12,785 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:47:12,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-08 08:47:12,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:47:12,842 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:47:12,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12 WrapperNode [2025-03-08 08:47:12,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:47:12,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:47:12,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:47:12,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:47:12,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,876 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 253 [2025-03-08 08:47:12,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:47:12,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:47:12,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:47:12,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:47:12,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,898 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 08:47:12,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:47:12,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:47:12,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:47:12,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:47:12,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (1/1) ... [2025-03-08 08:47:12,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:47:12,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:47:12,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:47:12,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:47:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:47:12,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 08:47:12,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:47:12,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:47:13,073 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:47:13,075 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:47:13,371 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2025-03-08 08:47:13,373 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:47:13,379 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:47:13,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:47:13,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:47:13 BoogieIcfgContainer [2025-03-08 08:47:13,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:47:13,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:47:13,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:47:13,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:47:13,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:47:12" (1/3) ... [2025-03-08 08:47:13,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64849846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:47:13, skipping insertion in model container [2025-03-08 08:47:13,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:47:12" (2/3) ... [2025-03-08 08:47:13,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64849846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:47:13, skipping insertion in model container [2025-03-08 08:47:13,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:47:13" (3/3) ... [2025-03-08 08:47:13,407 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2025-03-08 08:47:13,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:47:13,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Barrel.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:47:13,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:47:13,467 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;@3af8bda1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:47:13,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:47:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 08:47:13,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:47:13,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 08:47:13,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:47:13,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:47:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 08:47:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:47:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373923896] [2025-03-08 08:47:13,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:47:13,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:47:13,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:47:13,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:47:13,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:47:13,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 08:47:13,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 08:47:13,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:13,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:47:13,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-03-08 08:47:13,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:47:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:47:14,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:47:14,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:47:14,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373923896] [2025-03-08 08:47:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373923896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:47:14,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:47:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:47:14,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524121831] [2025-03-08 08:47:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:47:14,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:47:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 08:47:14,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:47:14,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:47:14,518 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:47:14,557 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-08 08:47:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:47:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-03-08 08:47:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:47:14,566 INFO L225 Difference]: With dead ends: 17 [2025-03-08 08:47:14,566 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 08:47:14,569 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-03-08 08:47:14,571 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:47:14,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:47:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 08:47:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-08 08:47:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 08:47:14,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 08:47:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:47:14,594 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 08:47:14,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:47:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 08:47:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 08:47:14,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:47:14,594 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 08:47:14,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 08:47:14,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:47:14,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:47:14,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:47:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 08:47:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:47:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962132659] [2025-03-08 08:47:14,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:47:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:47:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:47:14,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:47:14,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 08:47:14,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 08:47:15,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 08:47:15,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:47:15,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:47:15,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-03-08 08:47:15,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:47:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:47:15,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:47:23,674 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-08 08:47:23,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:47:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962132659] [2025-03-08 08:47:23,675 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-08 08:47:23,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-03-08 08:47:23,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 08:47:23,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:47:23,877 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-03-08 08:47:23,880 INFO L158 Benchmark]: Toolchain (without parser) took 11292.32ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 92.3MB in the beginning and 470.3MB in the end (delta: -378.0MB). Peak memory consumption was 311.0MB. Max. memory is 16.1GB. [2025-03-08 08:47:23,880 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:47:23,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.56ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 08:47:23,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.99ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 72.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:47:23,881 INFO L158 Benchmark]: Boogie Preprocessor took 32.45ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 69.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 08:47:23,881 INFO L158 Benchmark]: IcfgBuilder took 471.99ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 37.6MB in the end (delta: 32.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 08:47:23,881 INFO L158 Benchmark]: TraceAbstraction took 10496.08ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 37.0MB in the beginning and 470.3MB in the end (delta: -433.3MB). Peak memory consumption was 260.7MB. Max. memory is 16.1GB. [2025-03-08 08:47:23,882 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.22ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.56ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.99ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 72.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.45ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 69.9MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 471.99ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 37.6MB in the end (delta: 32.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10496.08ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 37.0MB in the beginning and 470.3MB in the end (delta: -433.3MB). Peak memory consumption was 260.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")