./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.vcegar_QF_BV_pj_icu_icctl_p1.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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:46,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:46,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:45:46,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:46,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:46,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:46,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:46,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:46,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:46,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:46,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:46,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:46,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:46,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:46,101 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:46,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:46,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:46,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:46,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:46,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:45:46,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:45:46,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:46,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:46,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:46,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:46,104 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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-03-16 22:45:46,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:46,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:46,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:46,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:46,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:46,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-16 22:45:47,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08f62fb5/fcb7e8b4ea3940499a9aab7575abe271/FLAG563c6a171 [2025-03-16 22:45:47,840 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:45:47,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-16 22:45:47,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08f62fb5/fcb7e8b4ea3940499a9aab7575abe271/FLAG563c6a171 [2025-03-16 22:45:47,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08f62fb5/fcb7e8b4ea3940499a9aab7575abe271 [2025-03-16 22:45:47,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:45:47,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:45:47,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:47,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:45:47,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:45:47,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:47" (1/1) ... [2025-03-16 22:45:47,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b24b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:47, skipping insertion in model container [2025-03-16 22:45:47,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:47" (1/1) ... [2025-03-16 22:45:47,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:45:48,074 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-16 22:45:48,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:48,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:45:48,332 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-16 22:45:48,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:48,511 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:45:48,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48 WrapperNode [2025-03-16 22:45:48,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:48,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:48,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:45:48,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:45:48,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:48,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:48,947 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4824 [2025-03-16 22:45:48,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:48,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:45:48,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:45:48,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:45:48,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:48,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,146 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-16 22:45:49,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:45:49,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:45:49,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:45:49,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:45:49,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (1/1) ... [2025-03-16 22:45:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:49,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:49,396 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-16 22:45:49,398 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-16 22:45:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:45:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:45:49,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:45:49,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:45:49,803 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:45:49,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:45:52,810 INFO L? ?]: Removed 3121 outVars from TransFormulas that were not future-live. [2025-03-16 22:45:52,810 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:45:52,954 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:45:52,954 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:45:52,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:52 BoogieIcfgContainer [2025-03-16 22:45:52,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:45:52,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:45:52,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:45:52,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:45:52,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:45:47" (1/3) ... [2025-03-16 22:45:52,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20aa0938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:52, skipping insertion in model container [2025-03-16 22:45:52,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:48" (2/3) ... [2025-03-16 22:45:52,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20aa0938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:52, skipping insertion in model container [2025-03-16 22:45:52,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:52" (3/3) ... [2025-03-16 22:45:52,963 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-16 22:45:52,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:45:52,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 1112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:45:53,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:45:53,055 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;@12f35b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:45:53,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:45:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 1112 states, 1110 states have (on average 1.5) internal successors, (1665), 1111 states have internal predecessors, (1665), 0 states have call successors, (0), 0 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-16 22:45:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 22:45:53,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:53,069 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-16 22:45:53,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:53,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1364779239, now seen corresponding path program 1 times [2025-03-16 22:45:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:53,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452872920] [2025-03-16 22:45:53,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:53,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 22:45:53,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 22:45:53,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:53,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:53,822 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-16 22:45:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:53,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452872920] [2025-03-16 22:45:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452872920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763559401] [2025-03-16 22:45:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:53,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:53,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:53,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:53,851 INFO L87 Difference]: Start difference. First operand has 1112 states, 1110 states have (on average 1.5) internal successors, (1665), 1111 states have internal predecessors, (1665), 0 states have call successors, (0), 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 20.5) internal successors, (82), 4 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-16 22:45:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:54,432 INFO L93 Difference]: Finished difference Result 2107 states and 3157 transitions. [2025-03-16 22:45:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:54,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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-16 22:45:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:54,451 INFO L225 Difference]: With dead ends: 2107 [2025-03-16 22:45:54,451 INFO L226 Difference]: Without dead ends: 1112 [2025-03-16 22:45:54,458 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-16 22:45:54,461 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 0 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:54,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4147 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:45:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-16 22:45:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2025-03-16 22:45:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 1.4977497749774977) internal successors, (1664), 1111 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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-16 22:45:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1664 transitions. [2025-03-16 22:45:54,537 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1664 transitions. Word has length 82 [2025-03-16 22:45:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:54,539 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1664 transitions. [2025-03-16 22:45:54,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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-16 22:45:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1664 transitions. [2025-03-16 22:45:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 22:45:54,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:54,541 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-16 22:45:54,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:45:54,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:54,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash -636835749, now seen corresponding path program 1 times [2025-03-16 22:45:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:54,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887547665] [2025-03-16 22:45:54,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:54,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 22:45:54,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 22:45:54,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:54,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:54,777 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-16 22:45:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887547665] [2025-03-16 22:45:54,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887547665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:54,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:54,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065821531] [2025-03-16 22:45:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:54,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:54,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:54,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:54,780 INFO L87 Difference]: Start difference. First operand 1112 states and 1664 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-16 22:45:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:55,388 INFO L93 Difference]: Finished difference Result 2109 states and 3156 transitions. [2025-03-16 22:45:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:55,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-16 22:45:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:55,395 INFO L225 Difference]: With dead ends: 2109 [2025-03-16 22:45:55,395 INFO L226 Difference]: Without dead ends: 1114 [2025-03-16 22:45:55,397 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-16 22:45:55,398 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 0 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4144 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:55,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4144 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:45:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-03-16 22:45:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2025-03-16 22:45:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1113 states have (on average 1.4968553459119496) internal successors, (1666), 1113 states have internal predecessors, (1666), 0 states have call successors, (0), 0 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-16 22:45:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1666 transitions. [2025-03-16 22:45:55,415 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1666 transitions. Word has length 83 [2025-03-16 22:45:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:55,415 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1666 transitions. [2025-03-16 22:45:55,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-16 22:45:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1666 transitions. [2025-03-16 22:45:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 22:45:55,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:55,418 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-16 22:45:55,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:45:55,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:55,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash -630528158, now seen corresponding path program 1 times [2025-03-16 22:45:55,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:55,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497464874] [2025-03-16 22:45:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:55,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 22:45:55,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 22:45:55,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:55,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:55,842 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-16 22:45:55,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497464874] [2025-03-16 22:45:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497464874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:55,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:55,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:45:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903682667] [2025-03-16 22:45:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:55,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:45:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:55,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:45:55,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:55,844 INFO L87 Difference]: Start difference. First operand 1114 states and 1666 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 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-16 22:45:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:56,478 INFO L93 Difference]: Finished difference Result 2115 states and 3163 transitions. [2025-03-16 22:45:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:56,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 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-16 22:45:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:56,482 INFO L225 Difference]: With dead ends: 2115 [2025-03-16 22:45:56,482 INFO L226 Difference]: Without dead ends: 1118 [2025-03-16 22:45:56,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:56,484 INFO L435 NwaCegarLoop]: 1378 mSDtfsCounter, 1592 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 5504 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:56,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1592 Valid, 5504 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:45:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-16 22:45:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1117. [2025-03-16 22:45:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1116 states have (on average 1.4955197132616487) internal successors, (1669), 1116 states have internal predecessors, (1669), 0 states have call successors, (0), 0 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-16 22:45:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1669 transitions. [2025-03-16 22:45:56,506 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1669 transitions. Word has length 84 [2025-03-16 22:45:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:56,506 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1669 transitions. [2025-03-16 22:45:56,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 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-16 22:45:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1669 transitions. [2025-03-16 22:45:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 22:45:56,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:56,511 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-16 22:45:56,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:45:56,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:56,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1018044255, now seen corresponding path program 1 times [2025-03-16 22:45:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184395991] [2025-03-16 22:45:56,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:56,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 22:45:56,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 22:45:56,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:56,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:57,238 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-16 22:45:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184395991] [2025-03-16 22:45:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184395991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794301818] [2025-03-16 22:45:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:57,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:45:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:57,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:45:57,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:45:57,239 INFO L87 Difference]: Start difference. First operand 1117 states and 1669 transitions. Second operand has 5 states, 5 states have (on average 17.0) 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-16 22:45:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:57,842 INFO L93 Difference]: Finished difference Result 2146 states and 3206 transitions. [2025-03-16 22:45:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:45:57,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) 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-16 22:45:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:57,846 INFO L225 Difference]: With dead ends: 2146 [2025-03-16 22:45:57,847 INFO L226 Difference]: Without dead ends: 1146 [2025-03-16 22:45:57,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:57,849 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1684 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:57,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 4099 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:45:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-16 22:45:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1123. [2025-03-16 22:45:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.4946524064171123) internal successors, (1677), 1122 states have internal predecessors, (1677), 0 states have call successors, (0), 0 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-16 22:45:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1677 transitions. [2025-03-16 22:45:57,871 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1677 transitions. Word has length 85 [2025-03-16 22:45:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1677 transitions. [2025-03-16 22:45:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) 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-16 22:45:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1677 transitions. [2025-03-16 22:45:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 22:45:57,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:57,872 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-16 22:45:57,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:45:57,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2118414269, now seen corresponding path program 1 times [2025-03-16 22:45:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:57,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975141743] [2025-03-16 22:45:57,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:57,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 22:45:57,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 22:45:57,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:57,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:58,380 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-16 22:45:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:58,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975141743] [2025-03-16 22:45:58,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975141743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:58,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:58,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:45:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989226497] [2025-03-16 22:45:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:58,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:45:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:58,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:45:58,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:58,388 INFO L87 Difference]: Start difference. First operand 1123 states and 1677 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 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-16 22:45:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:59,047 INFO L93 Difference]: Finished difference Result 2150 states and 3211 transitions. [2025-03-16 22:45:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:45:59,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 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-16 22:45:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:59,053 INFO L225 Difference]: With dead ends: 2150 [2025-03-16 22:45:59,053 INFO L226 Difference]: Without dead ends: 1150 [2025-03-16 22:45:59,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:45:59,057 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 1695 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 4140 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:59,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 4140 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:45:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-03-16 22:45:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1126. [2025-03-16 22:45:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 1.4942222222222221) internal successors, (1681), 1125 states have internal predecessors, (1681), 0 states have call successors, (0), 0 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-16 22:45:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1681 transitions. [2025-03-16 22:45:59,076 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1681 transitions. Word has length 86 [2025-03-16 22:45:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:59,076 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1681 transitions. [2025-03-16 22:45:59,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 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-16 22:45:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1681 transitions. [2025-03-16 22:45:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 22:45:59,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:59,078 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-16 22:45:59,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:45:59,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:59,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash -469468700, now seen corresponding path program 1 times [2025-03-16 22:45:59,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:59,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983873241] [2025-03-16 22:45:59,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:59,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 22:45:59,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 22:45:59,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:59,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:59,557 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-16 22:45:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983873241] [2025-03-16 22:45:59,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983873241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:59,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:59,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:45:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439190674] [2025-03-16 22:45:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:59,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:45:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:59,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:45:59,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:45:59,560 INFO L87 Difference]: Start difference. First operand 1126 states and 1681 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 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-16 22:46:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:00,662 INFO L93 Difference]: Finished difference Result 2154 states and 3216 transitions. [2025-03-16 22:46:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:46:00,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 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-16 22:46:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:00,666 INFO L225 Difference]: With dead ends: 2154 [2025-03-16 22:46:00,666 INFO L226 Difference]: Without dead ends: 1154 [2025-03-16 22:46:00,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:46:00,668 INFO L435 NwaCegarLoop]: 1362 mSDtfsCounter, 1701 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 9524 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:00,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 9524 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 22:46:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-03-16 22:46:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1129. [2025-03-16 22:46:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.4937943262411348) internal successors, (1685), 1128 states have internal predecessors, (1685), 0 states have call successors, (0), 0 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-16 22:46:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1685 transitions. [2025-03-16 22:46:00,689 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1685 transitions. Word has length 87 [2025-03-16 22:46:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:00,689 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1685 transitions. [2025-03-16 22:46:00,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 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-16 22:46:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1685 transitions. [2025-03-16 22:46:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 22:46:00,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:00,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:46:00,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:46:00,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:00,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1064657199, now seen corresponding path program 1 times [2025-03-16 22:46:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:00,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919500909] [2025-03-16 22:46:00,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:00,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:00,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 22:46:00,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 22:46:00,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:00,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:01,034 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-16 22:46:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919500909] [2025-03-16 22:46:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919500909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:46:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500960040] [2025-03-16 22:46:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:01,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:46:01,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:01,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:46:01,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:46:01,037 INFO L87 Difference]: Start difference. First operand 1129 states and 1685 transitions. Second operand has 5 states, 5 states have (on average 17.4) 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-16 22:46:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:01,593 INFO L93 Difference]: Finished difference Result 2147 states and 3205 transitions. [2025-03-16 22:46:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:46:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) 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-16 22:46:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:01,597 INFO L225 Difference]: With dead ends: 2147 [2025-03-16 22:46:01,597 INFO L226 Difference]: Without dead ends: 1147 [2025-03-16 22:46:01,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:46:01,599 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1679 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:01,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 4100 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:46:01,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-03-16 22:46:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1129. [2025-03-16 22:46:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 1.4929078014184398) internal successors, (1684), 1128 states have internal predecessors, (1684), 0 states have call successors, (0), 0 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-16 22:46:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1684 transitions. [2025-03-16 22:46:01,620 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1684 transitions. Word has length 87 [2025-03-16 22:46:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:01,620 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1684 transitions. [2025-03-16 22:46:01,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) 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-16 22:46:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1684 transitions. [2025-03-16 22:46:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 22:46:01,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:01,621 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-16 22:46:01,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:46:01,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash -149766232, now seen corresponding path program 1 times [2025-03-16 22:46:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160314085] [2025-03-16 22:46:01,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:01,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:01,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 22:46:01,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 22:46:01,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:01,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:46:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160314085] [2025-03-16 22:46:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160314085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:02,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:02,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:46:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823324056] [2025-03-16 22:46:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:46:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:02,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:46:02,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:46:02,090 INFO L87 Difference]: Start difference. First operand 1129 states and 1684 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-16 22:46:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:02,995 INFO L93 Difference]: Finished difference Result 2153 states and 3213 transitions. [2025-03-16 22:46:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:46:02,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-16 22:46:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:02,999 INFO L225 Difference]: With dead ends: 2153 [2025-03-16 22:46:02,999 INFO L226 Difference]: Without dead ends: 1153 [2025-03-16 22:46:03,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:46:03,001 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 1693 mSDsluCounter, 6825 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 8188 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:03,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 8188 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 22:46:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-03-16 22:46:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1132. [2025-03-16 22:46:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.4924845269672855) internal successors, (1688), 1131 states have internal predecessors, (1688), 0 states have call successors, (0), 0 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-16 22:46:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1688 transitions. [2025-03-16 22:46:03,018 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1688 transitions. Word has length 88 [2025-03-16 22:46:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:03,018 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1688 transitions. [2025-03-16 22:46:03,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 8 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-16 22:46:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1688 transitions. [2025-03-16 22:46:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 22:46:03,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:03,019 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-16 22:46:03,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:46:03,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1337131, now seen corresponding path program 1 times [2025-03-16 22:46:03,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:03,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771765256] [2025-03-16 22:46:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:03,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 22:46:03,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 22:46:03,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:03,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:03,254 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-16 22:46:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771765256] [2025-03-16 22:46:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771765256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:03,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:46:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839293078] [2025-03-16 22:46:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:03,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:46:03,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:03,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:46:03,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:46:03,256 INFO L87 Difference]: Start difference. First operand 1132 states and 1688 transitions. Second operand has 5 states, 5 states have (on average 17.6) 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-16 22:46:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:03,781 INFO L93 Difference]: Finished difference Result 2146 states and 3202 transitions. [2025-03-16 22:46:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:46:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) 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-16 22:46:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:03,785 INFO L225 Difference]: With dead ends: 2146 [2025-03-16 22:46:03,785 INFO L226 Difference]: Without dead ends: 1146 [2025-03-16 22:46:03,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:46:03,786 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1670 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:03,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 4100 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:46:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-16 22:46:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1132. [2025-03-16 22:46:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.4916003536693192) internal successors, (1687), 1131 states have internal predecessors, (1687), 0 states have call successors, (0), 0 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-16 22:46:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1687 transitions. [2025-03-16 22:46:03,801 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1687 transitions. Word has length 88 [2025-03-16 22:46:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:03,801 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1687 transitions. [2025-03-16 22:46:03,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) 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-16 22:46:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1687 transitions. [2025-03-16 22:46:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:46:03,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:03,802 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-16 22:46:03,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:46:03,803 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:03,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1912879738, now seen corresponding path program 1 times [2025-03-16 22:46:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971748089] [2025-03-16 22:46:03,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:03,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:46:03,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:46:03,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:03,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:04,008 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-16 22:46:04,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:04,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971748089] [2025-03-16 22:46:04,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971748089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:04,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:04,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:46:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605455847] [2025-03-16 22:46:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:04,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:46:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:04,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:46:04,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:46:04,010 INFO L87 Difference]: Start difference. First operand 1132 states and 1687 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-16 22:46:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:04,447 INFO L93 Difference]: Finished difference Result 2143 states and 3197 transitions. [2025-03-16 22:46:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:46:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-16 22:46:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:04,450 INFO L225 Difference]: With dead ends: 2143 [2025-03-16 22:46:04,450 INFO L226 Difference]: Without dead ends: 1143 [2025-03-16 22:46:04,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:46:04,452 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1661 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:04,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 4097 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:46:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-16 22:46:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2025-03-16 22:46:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.490716180371353) internal successors, (1686), 1131 states have internal predecessors, (1686), 0 states have call successors, (0), 0 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-16 22:46:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1686 transitions. [2025-03-16 22:46:04,464 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1686 transitions. Word has length 89 [2025-03-16 22:46:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:04,464 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1686 transitions. [2025-03-16 22:46:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 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-16 22:46:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1686 transitions. [2025-03-16 22:46:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:46:04,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:04,465 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-16 22:46:04,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:46:04,465 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:04,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1335411991, now seen corresponding path program 1 times [2025-03-16 22:46:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407138649] [2025-03-16 22:46:04,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:04,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:04,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:46:04,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:46:04,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:04,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:04,911 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-16 22:46:04,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407138649] [2025-03-16 22:46:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407138649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:04,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:04,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:46:04,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422448307] [2025-03-16 22:46:04,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:04,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:46:04,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:04,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:46:04,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:46:04,913 INFO L87 Difference]: Start difference. First operand 1132 states and 1686 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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-16 22:46:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:05,471 INFO L93 Difference]: Finished difference Result 2147 states and 3202 transitions. [2025-03-16 22:46:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:46:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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-16 22:46:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:05,474 INFO L225 Difference]: With dead ends: 2147 [2025-03-16 22:46:05,474 INFO L226 Difference]: Without dead ends: 1147 [2025-03-16 22:46:05,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:46:05,476 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 1668 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:05,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 4152 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:46:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-03-16 22:46:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1135. [2025-03-16 22:46:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 1.490299823633157) internal successors, (1690), 1134 states have internal predecessors, (1690), 0 states have call successors, (0), 0 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-16 22:46:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1690 transitions. [2025-03-16 22:46:05,490 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1690 transitions. Word has length 89 [2025-03-16 22:46:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:05,490 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1690 transitions. [2025-03-16 22:46:05,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 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-16 22:46:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1690 transitions. [2025-03-16 22:46:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 22:46:05,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:05,491 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-16 22:46:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:46:05,491 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash 566136205, now seen corresponding path program 1 times [2025-03-16 22:46:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409446106] [2025-03-16 22:46:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:05,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 22:46:05,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 22:46:05,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:05,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:06,060 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-16 22:46:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409446106] [2025-03-16 22:46:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409446106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 22:46:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134817014] [2025-03-16 22:46:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:06,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 22:46:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:06,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 22:46:06,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:46:06,061 INFO L87 Difference]: Start difference. First operand 1135 states and 1690 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 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-16 22:46:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:06,951 INFO L93 Difference]: Finished difference Result 2149 states and 3204 transitions. [2025-03-16 22:46:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 22:46:06,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 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-16 22:46:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:06,954 INFO L225 Difference]: With dead ends: 2149 [2025-03-16 22:46:06,954 INFO L226 Difference]: Without dead ends: 1149 [2025-03-16 22:46:06,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-16 22:46:06,956 INFO L435 NwaCegarLoop]: 1358 mSDtfsCounter, 1669 mSDsluCounter, 6843 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 8201 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:06,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 8201 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:46:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-16 22:46:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1141. [2025-03-16 22:46:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.4894736842105263) internal successors, (1698), 1140 states have internal predecessors, (1698), 0 states have call successors, (0), 0 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-16 22:46:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1698 transitions. [2025-03-16 22:46:06,969 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1698 transitions. Word has length 90 [2025-03-16 22:46:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:06,969 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1698 transitions. [2025-03-16 22:46:06,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 12 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-16 22:46:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1698 transitions. [2025-03-16 22:46:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 22:46:06,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:06,970 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-16 22:46:06,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:46:06,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:06,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1726707074, now seen corresponding path program 1 times [2025-03-16 22:46:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:06,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021357203] [2025-03-16 22:46:06,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:07,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 22:46:07,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 22:46:07,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:07,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:46:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021357203] [2025-03-16 22:46:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021357203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:07,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:07,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:46:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036001023] [2025-03-16 22:46:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:07,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:46:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:07,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:46:07,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:46:07,234 INFO L87 Difference]: Start difference. First operand 1141 states and 1698 transitions. Second operand has 5 states, 5 states have (on average 18.0) 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-16 22:46:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:07,767 INFO L93 Difference]: Finished difference Result 2150 states and 3204 transitions. [2025-03-16 22:46:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:46:07,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) 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-16 22:46:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:07,770 INFO L225 Difference]: With dead ends: 2150 [2025-03-16 22:46:07,770 INFO L226 Difference]: Without dead ends: 1144 [2025-03-16 22:46:07,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:46:07,772 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1652 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:07,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 4097 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:46:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-16 22:46:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1138. [2025-03-16 22:46:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.4890061565523307) internal successors, (1693), 1137 states have internal predecessors, (1693), 0 states have call successors, (0), 0 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-16 22:46:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1693 transitions. [2025-03-16 22:46:07,787 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1693 transitions. Word has length 90 [2025-03-16 22:46:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1693 transitions. [2025-03-16 22:46:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) 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-16 22:46:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1693 transitions. [2025-03-16 22:46:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:46:07,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:07,789 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-16 22:46:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:46:07,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 19551086, now seen corresponding path program 1 times [2025-03-16 22:46:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957621697] [2025-03-16 22:46:07,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:07,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:46:07,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:46:07,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:07,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:08,190 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-16 22:46:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:08,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957621697] [2025-03-16 22:46:08,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957621697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:08,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:08,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:46:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154174475] [2025-03-16 22:46:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:08,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:46:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:08,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:46:08,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:46:08,192 INFO L87 Difference]: Start difference. First operand 1138 states and 1693 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-16 22:46:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:08,732 INFO L93 Difference]: Finished difference Result 2141 states and 3191 transitions. [2025-03-16 22:46:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:46:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-16 22:46:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:08,735 INFO L225 Difference]: With dead ends: 2141 [2025-03-16 22:46:08,735 INFO L226 Difference]: Without dead ends: 1141 [2025-03-16 22:46:08,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:46:08,736 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1643 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 4097 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:08,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 4097 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:46:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-16 22:46:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1138. [2025-03-16 22:46:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.4881266490765173) internal successors, (1692), 1137 states have internal predecessors, (1692), 0 states have call successors, (0), 0 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-16 22:46:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1692 transitions. [2025-03-16 22:46:08,749 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1692 transitions. Word has length 91 [2025-03-16 22:46:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:08,749 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1692 transitions. [2025-03-16 22:46:08,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-16 22:46:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1692 transitions. [2025-03-16 22:46:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:46:08,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:08,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:46:08,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:46:08,751 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:08,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -865688978, now seen corresponding path program 1 times [2025-03-16 22:46:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782416881] [2025-03-16 22:46:08,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:08,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:46:08,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:46:08,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:08,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:09,056 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-16 22:46:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782416881] [2025-03-16 22:46:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782416881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:46:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685267178] [2025-03-16 22:46:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:09,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:46:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:09,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:46:09,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:46:09,058 INFO L87 Difference]: Start difference. First operand 1138 states and 1692 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 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-16 22:46:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:09,537 INFO L93 Difference]: Finished difference Result 2145 states and 3196 transitions. [2025-03-16 22:46:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:46:09,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 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-16 22:46:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:09,540 INFO L225 Difference]: With dead ends: 2145 [2025-03-16 22:46:09,540 INFO L226 Difference]: Without dead ends: 1145 [2025-03-16 22:46:09,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:46:09,541 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1645 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:09,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 4126 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:46:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-03-16 22:46:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1141. [2025-03-16 22:46:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.487719298245614) internal successors, (1696), 1140 states have internal predecessors, (1696), 0 states have call successors, (0), 0 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-16 22:46:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1696 transitions. [2025-03-16 22:46:09,552 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1696 transitions. Word has length 91 [2025-03-16 22:46:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:09,553 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1696 transitions. [2025-03-16 22:46:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 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-16 22:46:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1696 transitions. [2025-03-16 22:46:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:46:09,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:09,553 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-16 22:46:09,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:46:09,554 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1933094511, now seen corresponding path program 1 times [2025-03-16 22:46:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979428294] [2025-03-16 22:46:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:09,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:46:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:46:09,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:09,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:10,255 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-16 22:46:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:46:10,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979428294] [2025-03-16 22:46:10,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979428294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:10,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 22:46:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229659015] [2025-03-16 22:46:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:10,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 22:46:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:46:10,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 22:46:10,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-16 22:46:10,259 INFO L87 Difference]: Start difference. First operand 1141 states and 1696 transitions. Second operand has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 17 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-16 22:46:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:11,998 INFO L93 Difference]: Finished difference Result 2169 states and 3232 transitions. [2025-03-16 22:46:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 22:46:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 17 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-16 22:46:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:12,001 INFO L225 Difference]: With dead ends: 2169 [2025-03-16 22:46:12,001 INFO L226 Difference]: Without dead ends: 1169 [2025-03-16 22:46:12,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-16 22:46:12,003 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 1612 mSDsluCounter, 20432 mSDsCounter, 0 mSdLazyCounter, 5011 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 21797 SdHoareTripleChecker+Invalid, 5012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:12,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 21797 Invalid, 5012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5011 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 22:46:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-16 22:46:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1159. [2025-03-16 22:46:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.4905008635578583) internal successors, (1726), 1158 states have internal predecessors, (1726), 0 states have call successors, (0), 0 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-16 22:46:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1726 transitions. [2025-03-16 22:46:12,014 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1726 transitions. Word has length 91 [2025-03-16 22:46:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:12,014 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1726 transitions. [2025-03-16 22:46:12,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 17 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-16 22:46:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1726 transitions. [2025-03-16 22:46:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:46:12,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:12,015 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-16 22:46:12,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:46:12,015 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:12,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1114031630, now seen corresponding path program 1 times [2025-03-16 22:46:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:46:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114771095] [2025-03-16 22:46:12,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:46:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:46:12,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:46:12,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:12,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:46:12,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:46:12,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:46:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:46:12,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:12,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:46:12,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:46:12,169 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:46:12,170 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:46:12,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:46:12,174 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:46:12,227 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:46:12,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:46:12,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:46:12 BoogieIcfgContainer [2025-03-16 22:46:12,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:46:12,249 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:46:12,249 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:46:12,249 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:46:12,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:52" (3/4) ... [2025-03-16 22:46:12,251 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:46:12,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:46:12,252 INFO L158 Benchmark]: Toolchain (without parser) took 24366.65ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 109.4MB in the beginning and 217.7MB in the end (delta: -108.2MB). Peak memory consumption was 208.8MB. Max. memory is 16.1GB. [2025-03-16 22:46:12,253 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:46:12,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.55ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 78.7MB in the end (delta: 30.8MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2025-03-16 22:46:12,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 435.14ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 78.7MB in the beginning and 254.0MB in the end (delta: -175.3MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2025-03-16 22:46:12,253 INFO L158 Benchmark]: Boogie Preprocessor took 418.95ms. Allocated memory is still 369.1MB. Free memory was 254.0MB in the beginning and 233.8MB in the end (delta: 20.2MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2025-03-16 22:46:12,253 INFO L158 Benchmark]: IcfgBuilder took 3585.69ms. Allocated memory was 369.1MB in the beginning and 620.8MB in the end (delta: 251.7MB). Free memory was 233.8MB in the beginning and 432.8MB in the end (delta: -199.0MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. [2025-03-16 22:46:12,253 INFO L158 Benchmark]: TraceAbstraction took 19291.74ms. Allocated memory was 620.8MB in the beginning and 453.0MB in the end (delta: -167.8MB). Free memory was 432.8MB in the beginning and 217.7MB in the end (delta: 215.2MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-03-16 22:46:12,253 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 453.0MB. Free memory was 217.7MB in the beginning and 217.7MB in the end (delta: 24.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:46:12,254 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.55ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 78.7MB in the end (delta: 30.8MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 435.14ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 78.7MB in the beginning and 254.0MB in the end (delta: -175.3MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 418.95ms. Allocated memory is still 369.1MB. Free memory was 254.0MB in the beginning and 233.8MB in the end (delta: 20.2MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * IcfgBuilder took 3585.69ms. Allocated memory was 369.1MB in the beginning and 620.8MB in the end (delta: 251.7MB). Free memory was 233.8MB in the beginning and 432.8MB in the end (delta: -199.0MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19291.74ms. Allocated memory was 620.8MB in the beginning and 453.0MB in the end (delta: -167.8MB). Free memory was 432.8MB in the beginning and 217.7MB in the end (delta: 215.2MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 453.0MB. Free memory was 217.7MB in the beginning and 217.7MB in the end (delta: 24.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 385. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_32 = 8; [L48] const SORT_21 var_35 = 16; [L49] const SORT_21 var_38 = 32; [L50] const SORT_21 var_41 = 64; [L51] const SORT_21 var_44 = 0; [L52] const SORT_3 var_47 = 1; [L53] const SORT_3 var_51 = 0; [L54] const SORT_6 var_138 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_360; [L72] SORT_3 input_382; [L73] SORT_3 input_397; [L74] SORT_3 input_412; [L75] SORT_3 input_427; [L76] SORT_3 input_442; [L77] SORT_3 input_457; [L78] SORT_3 input_472; [L79] SORT_3 input_487; [L80] SORT_3 input_502; [L81] SORT_3 input_517; [L82] SORT_3 input_532; [L83] SORT_3 input_547; [L84] SORT_3 input_562; [L85] SORT_3 input_577; [L86] SORT_3 input_592; [L87] SORT_3 input_608; [L88] SORT_3 input_610; [L89] SORT_3 input_612; [L90] SORT_3 input_614; [L91] SORT_3 input_616; [L92] SORT_3 input_618; [L93] SORT_3 input_620; [L94] SORT_3 input_622; [L95] SORT_3 input_627; [L96] SORT_3 input_669; [L97] SORT_3 input_678; [L98] SORT_21 input_683; [L99] SORT_21 input_684; [L100] SORT_21 input_685; [L101] SORT_21 input_686; [L102] SORT_21 input_689; [L103] SORT_21 input_693; [L104] SORT_21 input_697; [L105] SORT_21 input_705; [L106] SORT_21 input_709; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_718; [L110] SORT_21 input_722; [L111] SORT_21 input_727; [L112] SORT_21 input_731; [L113] SORT_21 input_736; [L114] SORT_21 input_738; [L115] SORT_21 input_739; [L116] SORT_21 input_741; [L117] SORT_21 input_745; [L118] SORT_21 input_750; [L119] SORT_21 input_757; [L120] SORT_21 input_758; [L121] SORT_21 input_760; [L122] SORT_21 input_764; [L123] SORT_21 input_769; [L124] SORT_21 input_771; [L125] SORT_21 input_772; [L126] SORT_21 input_774; [L127] SORT_21 input_778; [L128] SORT_21 input_783; [L129] SORT_21 input_787; [L130] SORT_21 input_792; [L131] SORT_21 input_794; [L132] SORT_21 input_800; [L133] SORT_21 input_812; [L134] SORT_3 input_830; [L135] SORT_3 input_837; [L136] SORT_3 input_848; [L137] SORT_3 input_854; [L138] SORT_3 input_860; [L139] SORT_3 input_866; [L140] SORT_3 input_872; [L141] SORT_3 input_878; [L142] SORT_3 input_884; [L143] SORT_3 input_890; [L144] SORT_3 input_896; [L145] SORT_3 input_902; [L146] SORT_3 input_908; [L147] SORT_3 input_914; [L148] SORT_3 input_920; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L151] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L152] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L153] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L154] SORT_21 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L155] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L156] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L157] SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L158] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L159] SORT_3 state_103 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L160] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L161] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L162] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L163] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L164] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L165] SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L166] SORT_3 state_134 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L167] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L168] SORT_3 state_144 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L169] SORT_3 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L170] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L171] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L172] SORT_3 state_173 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L173] SORT_3 state_183 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L174] SORT_3 state_188 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L175] SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L176] SORT_3 state_200 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L177] SORT_3 state_213 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L178] SORT_3 state_226 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_3 init_53_arg_1 = var_51; [L183] state_52 = init_53_arg_1 [L184] SORT_3 init_55_arg_1 = var_51; [L185] state_54 = init_55_arg_1 [L186] SORT_3 init_57_arg_1 = var_51; [L187] state_56 = init_57_arg_1 [L188] SORT_21 init_59_arg_1 = var_22; [L189] state_58 = init_59_arg_1 [L190] SORT_3 init_63_arg_1 = var_51; [L191] state_62 = init_63_arg_1 [L192] SORT_3 init_67_arg_1 = var_51; [L193] state_66 = init_67_arg_1 [L194] SORT_3 init_71_arg_1 = var_51; [L195] state_70 = init_71_arg_1 [L196] SORT_3 init_87_arg_1 = var_51; [L197] state_86 = init_87_arg_1 [L198] SORT_3 init_104_arg_1 = var_51; [L199] state_103 = init_104_arg_1 [L200] SORT_3 init_107_arg_1 = var_51; [L201] state_106 = init_107_arg_1 [L202] SORT_3 init_109_arg_1 = var_51; [L203] state_108 = init_109_arg_1 [L204] SORT_3 init_113_arg_1 = var_51; [L205] state_112 = init_113_arg_1 [L206] SORT_3 init_117_arg_1 = var_51; [L207] state_116 = init_117_arg_1 [L208] SORT_3 init_122_arg_1 = var_51; [L209] state_121 = init_122_arg_1 [L210] SORT_3 init_125_arg_1 = var_51; [L211] state_124 = init_125_arg_1 [L212] SORT_3 init_135_arg_1 = var_51; [L213] state_134 = init_135_arg_1 [L214] SORT_3 init_142_arg_1 = var_51; [L215] state_141 = init_142_arg_1 [L216] SORT_3 init_145_arg_1 = var_51; [L217] state_144 = init_145_arg_1 [L218] SORT_3 init_154_arg_1 = var_51; [L219] state_153 = init_154_arg_1 [L220] SORT_3 init_159_arg_1 = var_51; [L221] state_158 = init_159_arg_1 [L222] SORT_3 init_162_arg_1 = var_51; [L223] state_161 = init_162_arg_1 [L224] SORT_3 init_174_arg_1 = var_51; [L225] state_173 = init_174_arg_1 [L226] SORT_3 init_184_arg_1 = var_51; [L227] state_183 = init_184_arg_1 [L228] SORT_3 init_189_arg_1 = var_51; [L229] state_188 = init_189_arg_1 [L230] SORT_3 init_192_arg_1 = var_51; [L231] state_191 = init_192_arg_1 [L232] SORT_3 init_201_arg_1 = var_51; [L233] state_200 = init_201_arg_1 [L234] SORT_3 init_214_arg_1 = var_51; [L235] state_213 = init_214_arg_1 [L236] SORT_3 init_227_arg_1 = var_51; [L237] state_226 = init_227_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_360 = __VERIFIER_nondet_uchar() [L257] input_382 = __VERIFIER_nondet_uchar() [L258] input_397 = __VERIFIER_nondet_uchar() [L259] input_412 = __VERIFIER_nondet_uchar() [L260] input_427 = __VERIFIER_nondet_uchar() [L261] input_442 = __VERIFIER_nondet_uchar() [L262] input_457 = __VERIFIER_nondet_uchar() [L263] input_472 = __VERIFIER_nondet_uchar() [L264] input_487 = __VERIFIER_nondet_uchar() [L265] input_502 = __VERIFIER_nondet_uchar() [L266] input_517 = __VERIFIER_nondet_uchar() [L267] input_532 = __VERIFIER_nondet_uchar() [L268] input_547 = __VERIFIER_nondet_uchar() [L269] input_562 = __VERIFIER_nondet_uchar() [L270] input_577 = __VERIFIER_nondet_uchar() [L271] input_592 = __VERIFIER_nondet_uchar() [L272] input_608 = __VERIFIER_nondet_uchar() [L273] input_610 = __VERIFIER_nondet_uchar() [L274] input_612 = __VERIFIER_nondet_uchar() [L275] input_614 = __VERIFIER_nondet_uchar() [L276] input_616 = __VERIFIER_nondet_uchar() [L277] input_618 = __VERIFIER_nondet_uchar() [L278] input_620 = __VERIFIER_nondet_uchar() [L279] input_622 = __VERIFIER_nondet_uchar() [L280] input_627 = __VERIFIER_nondet_uchar() [L281] input_669 = __VERIFIER_nondet_uchar() [L282] input_678 = __VERIFIER_nondet_uchar() [L283] input_683 = __VERIFIER_nondet_uchar() [L284] input_684 = __VERIFIER_nondet_uchar() [L285] input_685 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_689 = __VERIFIER_nondet_uchar() [L288] input_693 = __VERIFIER_nondet_uchar() [L289] input_697 = __VERIFIER_nondet_uchar() [L290] input_705 = __VERIFIER_nondet_uchar() [L291] input_709 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_718 = __VERIFIER_nondet_uchar() [L295] input_722 = __VERIFIER_nondet_uchar() [L296] input_727 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_736 = __VERIFIER_nondet_uchar() [L299] input_738 = __VERIFIER_nondet_uchar() [L300] input_739 = __VERIFIER_nondet_uchar() [L301] input_741 = __VERIFIER_nondet_uchar() [L302] input_745 = __VERIFIER_nondet_uchar() [L303] input_750 = __VERIFIER_nondet_uchar() [L304] input_757 = __VERIFIER_nondet_uchar() [L305] input_758 = __VERIFIER_nondet_uchar() [L306] input_760 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_769 = __VERIFIER_nondet_uchar() [L309] input_771 = __VERIFIER_nondet_uchar() [L310] input_772 = __VERIFIER_nondet_uchar() [L311] input_774 = __VERIFIER_nondet_uchar() [L312] input_778 = __VERIFIER_nondet_uchar() [L313] input_783 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_792 = __VERIFIER_nondet_uchar() [L316] input_794 = __VERIFIER_nondet_uchar() [L317] input_800 = __VERIFIER_nondet_uchar() [L318] input_812 = __VERIFIER_nondet_uchar() [L319] input_830 = __VERIFIER_nondet_uchar() [L320] input_837 = __VERIFIER_nondet_uchar() [L321] input_848 = __VERIFIER_nondet_uchar() [L322] input_854 = __VERIFIER_nondet_uchar() [L323] input_860 = __VERIFIER_nondet_uchar() [L324] input_866 = __VERIFIER_nondet_uchar() [L325] input_872 = __VERIFIER_nondet_uchar() [L326] input_878 = __VERIFIER_nondet_uchar() [L327] input_884 = __VERIFIER_nondet_uchar() [L328] input_890 = __VERIFIER_nondet_uchar() [L329] input_896 = __VERIFIER_nondet_uchar() [L330] input_902 = __VERIFIER_nondet_uchar() [L331] input_908 = __VERIFIER_nondet_uchar() [L332] input_914 = __VERIFIER_nondet_uchar() [L333] input_920 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_3 var_31_arg_0 = var_28; [L349] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_31_arg_0=1, var_31_arg_1=0, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L351] SORT_21 var_33_arg_0 = state_23; [L352] SORT_21 var_33_arg_1 = var_32; [L353] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L354] SORT_3 var_34_arg_0 = var_31; [L355] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_34_arg_0=1, var_34_arg_1=0, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L357] SORT_21 var_36_arg_0 = state_23; [L358] SORT_21 var_36_arg_1 = var_35; [L359] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L360] SORT_3 var_37_arg_0 = var_34; [L361] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_37_arg_0=1, var_37_arg_1=0, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L363] SORT_21 var_39_arg_0 = state_23; [L364] SORT_21 var_39_arg_1 = var_38; [L365] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L366] SORT_3 var_40_arg_0 = var_37; [L367] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_40_arg_0=1, var_40_arg_1=0, var_41=64, var_44=0, var_47=1, var_51=0] [L368] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L368] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_41; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_40; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_43_arg_0=1, var_43_arg_1=0, var_44=0, var_47=1, var_51=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_45_arg_0 = state_23; [L376] SORT_21 var_45_arg_1 = var_44; [L377] SORT_3 var_45 = var_45_arg_0 == var_45_arg_1; [L378] SORT_3 var_46_arg_0 = var_43; [L379] SORT_3 var_46_arg_1 = var_45; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46_arg_0=1, var_46_arg_1=0, var_47=1, var_51=0] [L380] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L380] SORT_3 var_46 = var_46_arg_0 | var_46_arg_1; [L381] SORT_3 var_48_arg_0 = var_46; [L382] SORT_3 var_48 = ~var_48_arg_0; [L383] SORT_3 var_49_arg_0 = var_47; [L384] SORT_3 var_49_arg_1 = var_48; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_49_arg_0=1, var_49_arg_1=-2, var_51=0] [L385] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L385] SORT_3 var_49 = var_49_arg_0 & var_49_arg_1; [L386] EXPR var_49 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L386] var_49 = var_49 & mask_SORT_3 [L387] SORT_3 bad_50_arg_0 = var_49; [L388] CALL __VERIFIER_assert(!(bad_50_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1112 locations, 1665 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23264 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23264 mSDsluCounter, 98513 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76621 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21803 IncrementalHoareTripleChecker+Invalid, 21808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 21892 mSDtfsCounter, 21803 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1159occurred in iteration=16, InterpolantAutomatonStates: 116, 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, 16 MinimizatonAttempts, 180 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1385 ConstructedInterpolants, 0 QuantifiedInterpolants, 7303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-16 22:46:12,278 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.vcegar_QF_BV_pj_icu_icctl_p1.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 c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:46:14,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:46:14,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:46:14,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:46:14,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:46:14,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:46:14,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:46:14,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:46:14,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:46:14,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:46:14,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:46:14,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:46:14,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:46:14,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:46:14,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:46:14,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:46:14,412 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:46:14,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:46:14,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:46:14,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:46:14,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:46:14,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:46:14,413 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 -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-03-16 22:46:14,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:46:14,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:46:14,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:46:14,682 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:46:14,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:46:14,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-16 22:46:15,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67300848d/2a786cb65130470fb0c864e33f809f3e/FLAGf8027960d [2025-03-16 22:46:16,240 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:46:16,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-16 22:46:16,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67300848d/2a786cb65130470fb0c864e33f809f3e/FLAGf8027960d [2025-03-16 22:46:16,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67300848d/2a786cb65130470fb0c864e33f809f3e [2025-03-16 22:46:16,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:46:16,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:46:16,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:46:16,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:46:16,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:46:16,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:16,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae1710c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16, skipping insertion in model container [2025-03-16 22:46:16,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:16,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:46:16,517 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-16 22:46:16,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:46:16,751 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:46:16,759 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.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-03-16 22:46:16,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:46:16,930 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:46:16,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16 WrapperNode [2025-03-16 22:46:16,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:46:16,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:46:16,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:46:16,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:46:16,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:16,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,049 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2616 [2025-03-16 22:46:17,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:46:17,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:46:17,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:46:17,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:46:17,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,113 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-16 22:46:17,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:46:17,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:46:17,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:46:17,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:46:17,223 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (1/1) ... [2025-03-16 22:46:17,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:46:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:46:17,253 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-16 22:46:17,262 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-16 22:46:17,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:46:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:46:17,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:46:17,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:46:17,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:46:17,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:46:19,564 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2025-03-16 22:46:19,564 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:46:19,570 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:46:19,571 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:46:19,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:46:19 BoogieIcfgContainer [2025-03-16 22:46:19,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:46:19,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:46:19,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:46:19,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:46:19,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:46:16" (1/3) ... [2025-03-16 22:46:19,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecf07c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:46:19, skipping insertion in model container [2025-03-16 22:46:19,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:46:16" (2/3) ... [2025-03-16 22:46:19,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecf07c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:46:19, skipping insertion in model container [2025-03-16 22:46:19,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:46:19" (3/3) ... [2025-03-16 22:46:19,581 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-03-16 22:46:19,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:46:19,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:46:19,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:46:19,640 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;@26dd5bdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:46:19,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:46:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:46:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:46:19,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:19,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:46:19,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:19,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:46:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:46:19,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51327169] [2025-03-16 22:46:19,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:19,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:46:19,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:46:19,669 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-16 22:46:19,672 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-16 22:46:20,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:46:20,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:46:20,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:20,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:20,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 22:46:20,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:46:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:46:20,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:46:20,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:46:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51327169] [2025-03-16 22:46:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51327169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:46:20,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:46:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:46:20,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296859754] [2025-03-16 22:46:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:46:20,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:46:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:46:20,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:46:20,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:46:20,302 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:46:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:20,372 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-03-16 22:46:20,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:46:20,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 22:46:20,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:20,379 INFO L225 Difference]: With dead ends: 15 [2025-03-16 22:46:20,379 INFO L226 Difference]: Without dead ends: 8 [2025-03-16 22:46:20,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 22:46:20,387 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:20,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:46:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-03-16 22:46:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-16 22:46:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:46:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:46:20,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:46:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:20,410 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:46:20,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:46:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:46:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:46:20,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:20,411 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:46:20,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:46:20,615 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-16 22:46:20,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:46:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:46:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319316887] [2025-03-16 22:46:20,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:46:20,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:46:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:46:20,621 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-16 22:46:20,624 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-16 22:46:21,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:46:21,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:46:21,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:46:21,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:21,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 22:46:21,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:46:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:46:21,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:46:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:46:25,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:46:25,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319316887] [2025-03-16 22:46:25,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319316887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:46:25,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:46:25,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:46:25,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650808444] [2025-03-16 22:46:25,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:46:25,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:46:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:46:25,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:46:25,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-03-16 22:46:25,829 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-16 22:46:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:46:26,023 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-16 22:46:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:46:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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 7 [2025-03-16 22:46:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:46:26,024 INFO L225 Difference]: With dead ends: 13 [2025-03-16 22:46:26,024 INFO L226 Difference]: Without dead ends: 11 [2025-03-16 22:46:26,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2025-03-16 22:46:26,025 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:46:26,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:46:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-16 22:46:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-16 22:46:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-16 22:46:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 22:46:26,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 22:46:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:46:26,027 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 22:46:26,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-16 22:46:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 22:46:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 22:46:26,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:46:26,028 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 22:46:26,040 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-16 22:46:26,228 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-16 22:46:26,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:46:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:46:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 22:46:26,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:46:26,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222560564] [2025-03-16 22:46:26,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:46:26,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:46:26,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:46:26,234 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:46:26,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:46:26,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 22:46:27,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 22:46:27,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:46:27,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:46:27,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-16 22:46:27,036 INFO L279 TraceCheckSpWp]: Computing forward predicates...