./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.15.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 05397c7941b2acd95b1b6d02c6c64b476ab8b290a5b56301ff8db7ca1986067b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:55:34,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:55:35,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:55:35,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:55:35,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:55:35,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:55:35,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:55:35,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:55:35,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:55:35,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:55:35,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:55:35,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:55:35,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:55:35,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:55:35,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:55:35,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:55:35,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:55:35,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:55:35,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:55:35,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:55:35,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:55:35,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:55:35,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:55:35,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:55:35,038 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05397c7941b2acd95b1b6d02c6c64b476ab8b290a5b56301ff8db7ca1986067b [2025-03-08 05:55:35,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:55:35,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:55:35,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:55:35,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:55:35,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:55:35,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.15.cil.c [2025-03-08 05:55:37,155 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4095d4200/5a0b439fd1bb4c2da821bdcccc53e717/FLAGcc94f627f [2025-03-08 05:55:37,460 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:55:37,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c [2025-03-08 05:55:37,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4095d4200/5a0b439fd1bb4c2da821bdcccc53e717/FLAGcc94f627f [2025-03-08 05:55:37,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4095d4200/5a0b439fd1bb4c2da821bdcccc53e717 [2025-03-08 05:55:37,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:55:37,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:55:37,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:55:37,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:55:37,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:55:37,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:37,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5563ccf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37, skipping insertion in model container [2025-03-08 05:55:37,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:37,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:55:37,663 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/systemc/transmitter.15.cil.c[706,719] [2025-03-08 05:55:37,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:55:37,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:55:37,830 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/systemc/transmitter.15.cil.c[706,719] [2025-03-08 05:55:37,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:55:37,921 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:55:37,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37 WrapperNode [2025-03-08 05:55:37,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:55:37,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:55:37,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:55:37,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:55:37,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:37,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:37,985 INFO L138 Inliner]: procedures = 54, calls = 69, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 867 [2025-03-08 05:55:37,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:55:37,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:55:37,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:55:37,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:55:38,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,038 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:55:38,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,046 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:55:38,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:55:38,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:55:38,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:55:38,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (1/1) ... [2025-03-08 05:55:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:55:38,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:55:38,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:55:38,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:55:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 05:55:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:55:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:55:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:55:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:55:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:55:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:55:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:55:38,193 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:55:38,195 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:55:38,988 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-08 05:55:38,988 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:55:39,014 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:55:39,017 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:55:39,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:55:39 BoogieIcfgContainer [2025-03-08 05:55:39,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:55:39,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:55:39,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:55:39,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:55:39,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:55:37" (1/3) ... [2025-03-08 05:55:39,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b20a7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:55:39, skipping insertion in model container [2025-03-08 05:55:39,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:55:37" (2/3) ... [2025-03-08 05:55:39,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b20a7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:55:39, skipping insertion in model container [2025-03-08 05:55:39,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:55:39" (3/3) ... [2025-03-08 05:55:39,026 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.15.cil.c [2025-03-08 05:55:39,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:55:39,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.15.cil.c that has 7 procedures, 399 locations, 1 initial locations, 17 loop locations, and 1 error locations. [2025-03-08 05:55:39,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:55:39,106 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;@2af706c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:55:39,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:55:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 366 states have (on average 1.6229508196721312) internal successors, (594), 367 states have internal predecessors, (594), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:55:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:39,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:39,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:39,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash -275343798, now seen corresponding path program 1 times [2025-03-08 05:55:39,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323671601] [2025-03-08 05:55:39,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:39,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:39,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:39,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:39,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:39,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:39,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:39,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323671601] [2025-03-08 05:55:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323671601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:39,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:39,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:55:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44588142] [2025-03-08 05:55:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:39,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:55:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:39,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:55:39,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:55:39,534 INFO L87 Difference]: Start difference. First operand has 399 states, 366 states have (on average 1.6229508196721312) internal successors, (594), 367 states have internal predecessors, (594), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:39,599 INFO L93 Difference]: Finished difference Result 788 states and 1277 transitions. [2025-03-08 05:55:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:55:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:39,609 INFO L225 Difference]: With dead ends: 788 [2025-03-08 05:55:39,609 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 05:55:39,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:55:39,617 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 618 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:39,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 625 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 05:55:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-08 05:55:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 361 states have (on average 1.5789473684210527) internal successors, (570), 362 states have internal predecessors, (570), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:55:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 622 transitions. [2025-03-08 05:55:39,673 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 622 transitions. Word has length 182 [2025-03-08 05:55:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:39,675 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 622 transitions. [2025-03-08 05:55:39,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 622 transitions. [2025-03-08 05:55:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:39,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:39,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:39,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:55:39,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 408886507, now seen corresponding path program 1 times [2025-03-08 05:55:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:39,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149821212] [2025-03-08 05:55:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:39,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:39,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:39,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:39,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:39,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149821212] [2025-03-08 05:55:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149821212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:55:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324549461] [2025-03-08 05:55:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:39,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:55:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:39,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:55:39,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:55:39,833 INFO L87 Difference]: Start difference. First operand 394 states and 622 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:39,882 INFO L93 Difference]: Finished difference Result 771 states and 1215 transitions. [2025-03-08 05:55:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:55:39,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:39,885 INFO L225 Difference]: With dead ends: 771 [2025-03-08 05:55:39,885 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 05:55:39,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:55:39,889 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 605 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:39,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 620 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:55:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 05:55:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-08 05:55:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 361 states have (on average 1.5761772853185596) internal successors, (569), 362 states have internal predecessors, (569), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:55:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 621 transitions. [2025-03-08 05:55:39,917 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 621 transitions. Word has length 182 [2025-03-08 05:55:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:39,917 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 621 transitions. [2025-03-08 05:55:39,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 621 transitions. [2025-03-08 05:55:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:39,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:39,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:39,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:55:39,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:39,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1271190668, now seen corresponding path program 1 times [2025-03-08 05:55:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677409858] [2025-03-08 05:55:39,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:39,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:39,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:39,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:39,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:39,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:40,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:40,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677409858] [2025-03-08 05:55:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677409858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:40,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:40,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379444993] [2025-03-08 05:55:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:40,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:40,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:40,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:40,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:40,197 INFO L87 Difference]: Start difference. First operand 394 states and 621 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:40,635 INFO L93 Difference]: Finished difference Result 794 states and 1262 transitions. [2025-03-08 05:55:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:40,641 INFO L225 Difference]: With dead ends: 794 [2025-03-08 05:55:40,641 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 05:55:40,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:40,643 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 855 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:40,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1242 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 05:55:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 394. [2025-03-08 05:55:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 361 states have (on average 1.5734072022160666) internal successors, (568), 362 states have internal predecessors, (568), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:55:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 620 transitions. [2025-03-08 05:55:40,659 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 620 transitions. Word has length 182 [2025-03-08 05:55:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:40,659 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 620 transitions. [2025-03-08 05:55:40,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 620 transitions. [2025-03-08 05:55:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:40,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:40,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:40,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:55:40,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:40,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1973907413, now seen corresponding path program 1 times [2025-03-08 05:55:40,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:40,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491186167] [2025-03-08 05:55:40,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:40,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:40,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:40,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:40,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:40,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491186167] [2025-03-08 05:55:40,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491186167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:40,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:40,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585811633] [2025-03-08 05:55:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:40,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:40,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:40,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:40,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:40,899 INFO L87 Difference]: Start difference. First operand 394 states and 620 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:41,824 INFO L93 Difference]: Finished difference Result 1413 states and 2253 transitions. [2025-03-08 05:55:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:41,831 INFO L225 Difference]: With dead ends: 1413 [2025-03-08 05:55:41,831 INFO L226 Difference]: Without dead ends: 1040 [2025-03-08 05:55:41,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:41,834 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 1892 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:41,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 3433 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 05:55:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-03-08 05:55:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 790. [2025-03-08 05:55:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 726 states have (on average 1.5853994490358128) internal successors, (1151), 729 states have internal predecessors, (1151), 49 states have call successors, (49), 12 states have call predecessors, (49), 14 states have return successors, (56), 50 states have call predecessors, (56), 49 states have call successors, (56) [2025-03-08 05:55:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1256 transitions. [2025-03-08 05:55:41,889 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1256 transitions. Word has length 182 [2025-03-08 05:55:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:41,890 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1256 transitions. [2025-03-08 05:55:41,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1256 transitions. [2025-03-08 05:55:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:41,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:41,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:55:41,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1801493332, now seen corresponding path program 1 times [2025-03-08 05:55:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608847422] [2025-03-08 05:55:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:41,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:41,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:41,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:41,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:42,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:42,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608847422] [2025-03-08 05:55:42,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608847422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:42,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307201207] [2025-03-08 05:55:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:42,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:42,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:42,075 INFO L87 Difference]: Start difference. First operand 790 states and 1256 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:42,870 INFO L93 Difference]: Finished difference Result 2804 states and 4480 transitions. [2025-03-08 05:55:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:42,883 INFO L225 Difference]: With dead ends: 2804 [2025-03-08 05:55:42,883 INFO L226 Difference]: Without dead ends: 2037 [2025-03-08 05:55:42,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:42,887 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1890 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:42,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 3300 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:55:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2025-03-08 05:55:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1568. [2025-03-08 05:55:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1446 states have (on average 1.5892116182572613) internal successors, (2298), 1453 states have internal predecessors, (2298), 91 states have call successors, (91), 24 states have call predecessors, (91), 30 states have return successors, (114), 94 states have call predecessors, (114), 91 states have call successors, (114) [2025-03-08 05:55:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2503 transitions. [2025-03-08 05:55:42,960 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2503 transitions. Word has length 182 [2025-03-08 05:55:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:42,960 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2503 transitions. [2025-03-08 05:55:42,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2503 transitions. [2025-03-08 05:55:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:42,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:42,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:42,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:55:42,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:42,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:42,964 INFO L85 PathProgramCache]: Analyzing trace with hash 836467723, now seen corresponding path program 1 times [2025-03-08 05:55:42,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:42,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200796802] [2025-03-08 05:55:42,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:42,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:42,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:42,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:42,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:42,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:43,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:43,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200796802] [2025-03-08 05:55:43,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200796802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:43,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083853436] [2025-03-08 05:55:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:43,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:43,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:43,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:43,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:43,150 INFO L87 Difference]: Start difference. First operand 1568 states and 2503 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:43,996 INFO L93 Difference]: Finished difference Result 5715 states and 9201 transitions. [2025-03-08 05:55:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:44,018 INFO L225 Difference]: With dead ends: 5715 [2025-03-08 05:55:44,019 INFO L226 Difference]: Without dead ends: 4170 [2025-03-08 05:55:44,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:44,026 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1885 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 3293 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:44,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 3293 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:55:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2025-03-08 05:55:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 3264. [2025-03-08 05:55:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3264 states, 3020 states have (on average 1.6066225165562913) internal successors, (4852), 3041 states have internal predecessors, (4852), 175 states have call successors, (175), 48 states have call predecessors, (175), 68 states have return successors, (254), 182 states have call predecessors, (254), 175 states have call successors, (254) [2025-03-08 05:55:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 5281 transitions. [2025-03-08 05:55:44,188 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 5281 transitions. Word has length 182 [2025-03-08 05:55:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:44,189 INFO L471 AbstractCegarLoop]: Abstraction has 3264 states and 5281 transitions. [2025-03-08 05:55:44,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 5281 transitions. [2025-03-08 05:55:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:44,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:44,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:44,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:55:44,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:44,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash -48268084, now seen corresponding path program 1 times [2025-03-08 05:55:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557715505] [2025-03-08 05:55:44,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:44,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:44,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:44,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:44,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:44,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:44,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557715505] [2025-03-08 05:55:44,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557715505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:44,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:44,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309826402] [2025-03-08 05:55:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:44,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:44,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:44,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:44,366 INFO L87 Difference]: Start difference. First operand 3264 states and 5281 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:45,259 INFO L93 Difference]: Finished difference Result 12078 states and 19767 transitions. [2025-03-08 05:55:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:45,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:45,300 INFO L225 Difference]: With dead ends: 12078 [2025-03-08 05:55:45,300 INFO L226 Difference]: Without dead ends: 8837 [2025-03-08 05:55:45,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:45,312 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1880 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:45,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 3272 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:55:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8837 states. [2025-03-08 05:55:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8837 to 7060. [2025-03-08 05:55:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7060 states, 6554 states have (on average 1.6341165700335674) internal successors, (10710), 6621 states have internal predecessors, (10710), 343 states have call successors, (343), 96 states have call predecessors, (343), 162 states have return successors, (630), 358 states have call predecessors, (630), 343 states have call successors, (630) [2025-03-08 05:55:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7060 states to 7060 states and 11683 transitions. [2025-03-08 05:55:45,602 INFO L78 Accepts]: Start accepts. Automaton has 7060 states and 11683 transitions. Word has length 182 [2025-03-08 05:55:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:45,602 INFO L471 AbstractCegarLoop]: Abstraction has 7060 states and 11683 transitions. [2025-03-08 05:55:45,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 7060 states and 11683 transitions. [2025-03-08 05:55:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:45,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:45,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:45,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:55:45,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:45,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash -353902613, now seen corresponding path program 1 times [2025-03-08 05:55:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134717569] [2025-03-08 05:55:45,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:45,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:45,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:45,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:45,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134717569] [2025-03-08 05:55:45,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134717569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:45,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:45,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:45,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881373387] [2025-03-08 05:55:45,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:45,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:45,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:45,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:45,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:45,784 INFO L87 Difference]: Start difference. First operand 7060 states and 11683 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:46,816 INFO L93 Difference]: Finished difference Result 26361 states and 44265 transitions. [2025-03-08 05:55:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:46,899 INFO L225 Difference]: With dead ends: 26361 [2025-03-08 05:55:46,899 INFO L226 Difference]: Without dead ends: 19324 [2025-03-08 05:55:46,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:46,977 INFO L435 NwaCegarLoop]: 754 mSDtfsCounter, 1875 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:46,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1911 Valid, 3263 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:55:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19324 states. [2025-03-08 05:55:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 15812. [2025-03-08 05:55:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15812 states, 14728 states have (on average 1.6686583378598587) internal successors, (24576), 14941 states have internal predecessors, (24576), 679 states have call successors, (679), 192 states have call predecessors, (679), 404 states have return successors, (1766), 710 states have call predecessors, (1766), 679 states have call successors, (1766) [2025-03-08 05:55:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15812 states to 15812 states and 27021 transitions. [2025-03-08 05:55:47,608 INFO L78 Accepts]: Start accepts. Automaton has 15812 states and 27021 transitions. Word has length 182 [2025-03-08 05:55:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 15812 states and 27021 transitions. [2025-03-08 05:55:47,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 15812 states and 27021 transitions. [2025-03-08 05:55:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:47,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:47,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:47,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:55:47,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:47,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1056498452, now seen corresponding path program 1 times [2025-03-08 05:55:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752743967] [2025-03-08 05:55:47,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:47,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752743967] [2025-03-08 05:55:47,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752743967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:47,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:47,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352815726] [2025-03-08 05:55:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:47,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:47,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:47,720 INFO L87 Difference]: Start difference. First operand 15812 states and 27021 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:48,437 INFO L93 Difference]: Finished difference Result 36706 states and 64637 transitions. [2025-03-08 05:55:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:48,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:48,520 INFO L225 Difference]: With dead ends: 36706 [2025-03-08 05:55:48,521 INFO L226 Difference]: Without dead ends: 20915 [2025-03-08 05:55:48,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:48,578 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 847 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:48,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1204 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20915 states. [2025-03-08 05:55:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20915 to 15812. [2025-03-08 05:55:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15812 states, 14728 states have (on average 1.6664177077675177) internal successors, (24543), 14941 states have internal predecessors, (24543), 679 states have call successors, (679), 192 states have call predecessors, (679), 404 states have return successors, (1766), 710 states have call predecessors, (1766), 679 states have call successors, (1766) [2025-03-08 05:55:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15812 states to 15812 states and 26988 transitions. [2025-03-08 05:55:49,421 INFO L78 Accepts]: Start accepts. Automaton has 15812 states and 26988 transitions. Word has length 182 [2025-03-08 05:55:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:49,421 INFO L471 AbstractCegarLoop]: Abstraction has 15812 states and 26988 transitions. [2025-03-08 05:55:49,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 15812 states and 26988 transitions. [2025-03-08 05:55:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:49,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:49,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:49,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:55:49,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:49,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -109331509, now seen corresponding path program 1 times [2025-03-08 05:55:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907040500] [2025-03-08 05:55:49,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:49,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:49,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:49,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:49,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:49,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907040500] [2025-03-08 05:55:49,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907040500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:49,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:49,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:55:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147950181] [2025-03-08 05:55:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:55:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:49,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:55:49,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:49,638 INFO L87 Difference]: Start difference. First operand 15812 states and 26988 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:50,999 INFO L93 Difference]: Finished difference Result 58842 states and 102241 transitions. [2025-03-08 05:55:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:55:51,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:51,148 INFO L225 Difference]: With dead ends: 58842 [2025-03-08 05:55:51,148 INFO L226 Difference]: Without dead ends: 43053 [2025-03-08 05:55:51,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:55:51,202 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1859 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:51,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 3209 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:55:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43053 states. [2025-03-08 05:55:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43053 to 36152. [2025-03-08 05:55:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36152 states, 33750 states have (on average 1.701125925925926) internal successors, (57413), 34417 states have internal predecessors, (57413), 1351 states have call successors, (1351), 384 states have call predecessors, (1351), 1050 states have return successors, (5574), 1414 states have call predecessors, (5574), 1351 states have call successors, (5574) [2025-03-08 05:55:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36152 states to 36152 states and 64338 transitions. [2025-03-08 05:55:52,654 INFO L78 Accepts]: Start accepts. Automaton has 36152 states and 64338 transitions. Word has length 182 [2025-03-08 05:55:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 36152 states and 64338 transitions. [2025-03-08 05:55:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36152 states and 64338 transitions. [2025-03-08 05:55:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:52,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:52,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:52,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:55:52,667 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:52,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1576568426, now seen corresponding path program 1 times [2025-03-08 05:55:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356186208] [2025-03-08 05:55:52,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:52,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:52,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:52,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:52,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356186208] [2025-03-08 05:55:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356186208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600828569] [2025-03-08 05:55:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:52,789 INFO L87 Difference]: Start difference. First operand 36152 states and 64338 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:54,136 INFO L93 Difference]: Finished difference Result 85405 states and 157051 transitions. [2025-03-08 05:55:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:54,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:54,295 INFO L225 Difference]: With dead ends: 85405 [2025-03-08 05:55:54,295 INFO L226 Difference]: Without dead ends: 49274 [2025-03-08 05:55:54,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:54,368 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 842 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:54,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1184 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:55:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2025-03-08 05:55:55,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 36152. [2025-03-08 05:55:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36152 states, 33750 states have (on average 1.6992) internal successors, (57348), 34417 states have internal predecessors, (57348), 1351 states have call successors, (1351), 384 states have call predecessors, (1351), 1050 states have return successors, (5574), 1414 states have call predecessors, (5574), 1351 states have call successors, (5574) [2025-03-08 05:55:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36152 states to 36152 states and 64273 transitions. [2025-03-08 05:55:55,773 INFO L78 Accepts]: Start accepts. Automaton has 36152 states and 64273 transitions. Word has length 182 [2025-03-08 05:55:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:55,775 INFO L471 AbstractCegarLoop]: Abstraction has 36152 states and 64273 transitions. [2025-03-08 05:55:55,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 36152 states and 64273 transitions. [2025-03-08 05:55:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:55,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:55,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:55:55,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:55,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1769499627, now seen corresponding path program 1 times [2025-03-08 05:55:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:55,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380342919] [2025-03-08 05:55:55,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:55,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:55,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:55,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:55,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380342919] [2025-03-08 05:55:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380342919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:55,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:55,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:55,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234717083] [2025-03-08 05:55:55,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:55,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:55,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:55,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:55,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:55,890 INFO L87 Difference]: Start difference. First operand 36152 states and 64273 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:55:57,783 INFO L93 Difference]: Finished difference Result 84676 states and 155463 transitions. [2025-03-08 05:55:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:55:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:55:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:55:57,960 INFO L225 Difference]: With dead ends: 84676 [2025-03-08 05:55:57,961 INFO L226 Difference]: Without dead ends: 48545 [2025-03-08 05:55:58,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:55:58,040 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 839 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:55:58,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1176 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:55:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48545 states. [2025-03-08 05:55:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48545 to 36152. [2025-03-08 05:55:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36152 states, 33750 states have (on average 1.6972740740740742) internal successors, (57283), 34417 states have internal predecessors, (57283), 1351 states have call successors, (1351), 384 states have call predecessors, (1351), 1050 states have return successors, (5574), 1414 states have call predecessors, (5574), 1351 states have call successors, (5574) [2025-03-08 05:55:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36152 states to 36152 states and 64208 transitions. [2025-03-08 05:55:59,831 INFO L78 Accepts]: Start accepts. Automaton has 36152 states and 64208 transitions. Word has length 182 [2025-03-08 05:55:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:55:59,831 INFO L471 AbstractCegarLoop]: Abstraction has 36152 states and 64208 transitions. [2025-03-08 05:55:59,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:55:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36152 states and 64208 transitions. [2025-03-08 05:55:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:55:59,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:55:59,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:55:59,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:55:59,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:55:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:55:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1637175882, now seen corresponding path program 1 times [2025-03-08 05:55:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:55:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820336980] [2025-03-08 05:55:59,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:55:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:55:59,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:55:59,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:55:59,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:55:59,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:55:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:55:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:55:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820336980] [2025-03-08 05:55:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820336980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:55:59,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:55:59,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:55:59,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662809273] [2025-03-08 05:55:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:55:59,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:55:59,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:55:59,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:55:59,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:55:59,948 INFO L87 Difference]: Start difference. First operand 36152 states and 64208 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:56:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:01,257 INFO L93 Difference]: Finished difference Result 83947 states and 153875 transitions. [2025-03-08 05:56:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:01,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:56:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:01,424 INFO L225 Difference]: With dead ends: 83947 [2025-03-08 05:56:01,424 INFO L226 Difference]: Without dead ends: 47816 [2025-03-08 05:56:01,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:01,519 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 836 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:01,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1168 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:56:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47816 states. [2025-03-08 05:56:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47816 to 36152. [2025-03-08 05:56:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36152 states, 33750 states have (on average 1.695348148148148) internal successors, (57218), 34417 states have internal predecessors, (57218), 1351 states have call successors, (1351), 384 states have call predecessors, (1351), 1050 states have return successors, (5574), 1414 states have call predecessors, (5574), 1351 states have call successors, (5574) [2025-03-08 05:56:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36152 states to 36152 states and 64143 transitions. [2025-03-08 05:56:03,484 INFO L78 Accepts]: Start accepts. Automaton has 36152 states and 64143 transitions. Word has length 182 [2025-03-08 05:56:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:03,485 INFO L471 AbstractCegarLoop]: Abstraction has 36152 states and 64143 transitions. [2025-03-08 05:56:03,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:56:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 36152 states and 64143 transitions. [2025-03-08 05:56:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:56:03,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:03,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:56:03,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1692228597, now seen corresponding path program 1 times [2025-03-08 05:56:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357096879] [2025-03-08 05:56:03,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:03,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:56:03,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:56:03,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:03,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357096879] [2025-03-08 05:56:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357096879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:03,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150737128] [2025-03-08 05:56:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:03,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:03,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:03,592 INFO L87 Difference]: Start difference. First operand 36152 states and 64143 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:56:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:06,404 INFO L93 Difference]: Finished difference Result 132798 states and 241387 transitions. [2025-03-08 05:56:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:56:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:06,738 INFO L225 Difference]: With dead ends: 132798 [2025-03-08 05:56:06,739 INFO L226 Difference]: Without dead ends: 96669 [2025-03-08 05:56:06,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:56:06,839 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 1830 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:06,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 3116 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 05:56:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96669 states. [2025-03-08 05:56:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96669 to 83148. [2025-03-08 05:56:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83148 states, 77624 states have (on average 1.7250850252499228) internal successors, (133908), 79685 states have internal predecessors, (133908), 2695 states have call successors, (2695), 768 states have call predecessors, (2695), 2828 states have return successors, (19334), 2822 states have call predecessors, (19334), 2695 states have call successors, (19334) [2025-03-08 05:56:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83148 states to 83148 states and 155937 transitions. [2025-03-08 05:56:10,317 INFO L78 Accepts]: Start accepts. Automaton has 83148 states and 155937 transitions. Word has length 182 [2025-03-08 05:56:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 83148 states and 155937 transitions. [2025-03-08 05:56:10,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:56:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 83148 states and 155937 transitions. [2025-03-08 05:56:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:56:10,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:10,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:10,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:56:10,330 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1941149226, now seen corresponding path program 1 times [2025-03-08 05:56:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240542917] [2025-03-08 05:56:10,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:10,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:56:10,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:56:10,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240542917] [2025-03-08 05:56:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240542917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:56:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793556428] [2025-03-08 05:56:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:10,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:10,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:10,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:10,414 INFO L87 Difference]: Start difference. First operand 83148 states and 155937 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:56:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:13,846 INFO L93 Difference]: Finished difference Result 196893 states and 383411 transitions. [2025-03-08 05:56:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 182 [2025-03-08 05:56:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:14,313 INFO L225 Difference]: With dead ends: 196893 [2025-03-08 05:56:14,313 INFO L226 Difference]: Without dead ends: 113766 [2025-03-08 05:56:14,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:14,584 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 830 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:14,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1152 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:56:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113766 states. [2025-03-08 05:56:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113766 to 83148. [2025-03-08 05:56:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83148 states, 77624 states have (on average 1.7234231680923426) internal successors, (133779), 79685 states have internal predecessors, (133779), 2695 states have call successors, (2695), 768 states have call predecessors, (2695), 2828 states have return successors, (19334), 2822 states have call predecessors, (19334), 2695 states have call successors, (19334) [2025-03-08 05:56:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83148 states to 83148 states and 155808 transitions. [2025-03-08 05:56:19,944 INFO L78 Accepts]: Start accepts. Automaton has 83148 states and 155808 transitions. Word has length 182 [2025-03-08 05:56:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 83148 states and 155808 transitions. [2025-03-08 05:56:19,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:56:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 83148 states and 155808 transitions. [2025-03-08 05:56:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 05:56:19,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:19,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:19,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:56:19,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:19,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1405328341, now seen corresponding path program 1 times [2025-03-08 05:56:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:19,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496324555] [2025-03-08 05:56:19,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:19,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 05:56:19,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 05:56:19,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:19,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:20,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-08 05:56:20,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496324555] [2025-03-08 05:56:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496324555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:20,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:20,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:20,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596836823] [2025-03-08 05:56:20,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:20,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:20,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:20,058 INFO L87 Difference]: Start difference. First operand 83148 states and 155808 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)