./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.03.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 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:45:01,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:45:01,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:45:01,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:45:01,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:45:01,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:45:01,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:45:01,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:45:01,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:45:01,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:45:01,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:45:01,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:45:01,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:45:01,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:45:01,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:45:01,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:45:01,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:45:01,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:45:01,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:45:01,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:45:01,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:45:01,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:45:01,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:45:01,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:45:01,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:45:01,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:45:01,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:45:01,538 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2025-03-03 14:45:01,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:45:01,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:45:01,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:45:01,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:45:01,803 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:45:01,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.03.cil.c [2025-03-03 14:45:02,929 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20cdb90c/0d02088c38ea430aa990ebd43a551e6f/FLAGdefa87474 [2025-03-03 14:45:03,162 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:45:03,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2025-03-03 14:45:03,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20cdb90c/0d02088c38ea430aa990ebd43a551e6f/FLAGdefa87474 [2025-03-03 14:45:03,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20cdb90c/0d02088c38ea430aa990ebd43a551e6f [2025-03-03 14:45:03,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:45:03,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:45:03,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:45:03,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:45:03,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:45:03,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69796613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03, skipping insertion in model container [2025-03-03 14:45:03,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:45:03,643 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.03.cil.c[706,719] [2025-03-03 14:45:03,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:45:03,720 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:45:03,729 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.03.cil.c[706,719] [2025-03-03 14:45:03,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:45:03,780 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:45:03,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03 WrapperNode [2025-03-03 14:45:03,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:45:03,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:45:03,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:45:03,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:45:03,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,815 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 307 [2025-03-03 14:45:03,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:45:03,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:45:03,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:45:03,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:45:03,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,845 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-03 14:45:03,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:45:03,867 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:45:03,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:45:03,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:45:03,870 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (1/1) ... [2025-03-03 14:45:03,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:45:03,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:45:03,898 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-03 14:45:03,901 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-03 14:45:03,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:45:03,919 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:45:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:45:03,919 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:45:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:45:03,919 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 14:45:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 14:45:03,919 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:45:03,919 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:45:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:45:03,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:45:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:45:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:45:03,920 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:45:03,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:45:03,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:45:03,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:45:03,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:45:04,331 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-03 14:45:04,332 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:45:04,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:45:04,346 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:45:04,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:45:04 BoogieIcfgContainer [2025-03-03 14:45:04,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:45:04,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:45:04,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:45:04,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:45:04,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:45:03" (1/3) ... [2025-03-03 14:45:04,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31034bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:45:04, skipping insertion in model container [2025-03-03 14:45:04,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:03" (2/3) ... [2025-03-03 14:45:04,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31034bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:45:04, skipping insertion in model container [2025-03-03 14:45:04,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:45:04" (3/3) ... [2025-03-03 14:45:04,356 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2025-03-03 14:45:04,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:45:04,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.03.cil.c that has 7 procedures, 163 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-03 14:45:04,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:45:04,423 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;@5ad991e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:45:04,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:45:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 139 states have (on average 1.4964028776978417) internal successors, (208), 141 states have internal predecessors, (208), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 14:45:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:04,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:04,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:04,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:04,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1815657902, now seen corresponding path program 1 times [2025-03-03 14:45:04,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736136192] [2025-03-03 14:45:04,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:04,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:04,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:04,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:04,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:04,690 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-03 14:45:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736136192] [2025-03-03 14:45:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736136192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:04,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:04,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764731662] [2025-03-03 14:45:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:04,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:04,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:04,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:04,719 INFO L87 Difference]: Start difference. First operand has 163 states, 139 states have (on average 1.4964028776978417) internal successors, (208), 141 states have internal predecessors, (208), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03 14:45:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:04,764 INFO L93 Difference]: Finished difference Result 316 states and 466 transitions. [2025-03-03 14:45:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:04,771 INFO L225 Difference]: With dead ends: 316 [2025-03-03 14:45:04,771 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 14:45:04,774 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-03 14:45:04,776 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 228 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-03 14:45:04,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 14:45:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-03 14:45:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 135 states have internal predecessors, (193), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 14:45:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2025-03-03 14:45:04,819 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 79 [2025-03-03 14:45:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:04,820 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2025-03-03 14:45:04,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03 14:45:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2025-03-03 14:45:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:04,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:04,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:45:04,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 861429007, now seen corresponding path program 1 times [2025-03-03 14:45:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110045061] [2025-03-03 14:45:04,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:04,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:04,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:04,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:04,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:45:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110045061] [2025-03-03 14:45:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110045061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928090125] [2025-03-03 14:45:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:05,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:05,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:05,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:05,022 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-03 14:45:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:05,377 INFO L93 Difference]: Finished difference Result 459 states and 671 transitions. [2025-03-03 14:45:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:45:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:05,380 INFO L225 Difference]: With dead ends: 459 [2025-03-03 14:45:05,380 INFO L226 Difference]: Without dead ends: 313 [2025-03-03 14:45:05,382 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-03 14:45:05,385 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 374 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:05,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 597 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:45:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-03 14:45:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 302. [2025-03-03 14:45:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 261 states have (on average 1.4482758620689655) internal successors, (378), 263 states have internal predecessors, (378), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2025-03-03 14:45:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 433 transitions. [2025-03-03 14:45:05,419 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 433 transitions. Word has length 79 [2025-03-03 14:45:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 433 transitions. [2025-03-03 14:45:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-03 14:45:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 433 transitions. [2025-03-03 14:45:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:05,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:05,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:05,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:45:05,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:05,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1141562958, now seen corresponding path program 1 times [2025-03-03 14:45:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786685082] [2025-03-03 14:45:05,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:05,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:05,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:05,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:05,581 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-03 14:45:05,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786685082] [2025-03-03 14:45:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786685082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766018255] [2025-03-03 14:45:05,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:05,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:05,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:05,583 INFO L87 Difference]: Start difference. First operand 302 states and 433 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:06,056 INFO L93 Difference]: Finished difference Result 797 states and 1153 transitions. [2025-03-03 14:45:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:06,059 INFO L225 Difference]: With dead ends: 797 [2025-03-03 14:45:06,059 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 14:45:06,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-03 14:45:06,060 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 400 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:06,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1129 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 14:45:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 439. [2025-03-03 14:45:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 380 states have (on average 1.4394736842105262) internal successors, (547), 383 states have internal predecessors, (547), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2025-03-03 14:45:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 627 transitions. [2025-03-03 14:45:06,098 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 627 transitions. Word has length 79 [2025-03-03 14:45:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:06,100 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 627 transitions. [2025-03-03 14:45:06,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 627 transitions. [2025-03-03 14:45:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:06,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:06,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:06,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:45:06,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:06,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 162830771, now seen corresponding path program 1 times [2025-03-03 14:45:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:06,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780271371] [2025-03-03 14:45:06,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:06,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:06,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:06,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:06,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:06,199 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-03 14:45:06,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:06,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780271371] [2025-03-03 14:45:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780271371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:06,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:06,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:06,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763079382] [2025-03-03 14:45:06,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:06,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:06,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:06,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:06,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:06,202 INFO L87 Difference]: Start difference. First operand 439 states and 627 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:06,646 INFO L93 Difference]: Finished difference Result 1221 states and 1760 transitions. [2025-03-03 14:45:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:06,650 INFO L225 Difference]: With dead ends: 1221 [2025-03-03 14:45:06,650 INFO L226 Difference]: Without dead ends: 793 [2025-03-03 14:45:06,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-03 14:45:06,653 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 395 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:06,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1113 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-03 14:45:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 724. [2025-03-03 14:45:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 627 states have (on average 1.4354066985645932) internal successors, (900), 634 states have internal predecessors, (900), 60 states have call successors, (60), 30 states have call predecessors, (60), 36 states have return successors, (76), 63 states have call predecessors, (76), 60 states have call successors, (76) [2025-03-03 14:45:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1036 transitions. [2025-03-03 14:45:06,705 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1036 transitions. Word has length 79 [2025-03-03 14:45:06,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:06,706 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1036 transitions. [2025-03-03 14:45:06,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1036 transitions. [2025-03-03 14:45:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:06,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:06,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:06,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:45:06,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2011849326, now seen corresponding path program 1 times [2025-03-03 14:45:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726801355] [2025-03-03 14:45:06,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:06,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:06,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:06,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:06,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:06,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:06,809 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-03 14:45:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:06,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726801355] [2025-03-03 14:45:06,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726801355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:06,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:06,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816639156] [2025-03-03 14:45:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:06,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:06,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:06,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:06,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:06,810 INFO L87 Difference]: Start difference. First operand 724 states and 1036 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:07,239 INFO L93 Difference]: Finished difference Result 2108 states and 3055 transitions. [2025-03-03 14:45:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:07,248 INFO L225 Difference]: With dead ends: 2108 [2025-03-03 14:45:07,248 INFO L226 Difference]: Without dead ends: 1395 [2025-03-03 14:45:07,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-03 14:45:07,253 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 390 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:07,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1101 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:45:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-03 14:45:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1321. [2025-03-03 14:45:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1142 states have (on average 1.436077057793345) internal successors, (1640), 1163 states have internal predecessors, (1640), 104 states have call successors, (104), 54 states have call predecessors, (104), 74 states have return successors, (168), 111 states have call predecessors, (168), 104 states have call successors, (168) [2025-03-03 14:45:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1912 transitions. [2025-03-03 14:45:07,338 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1912 transitions. Word has length 79 [2025-03-03 14:45:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:07,338 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1912 transitions. [2025-03-03 14:45:07,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1912 transitions. [2025-03-03 14:45:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:07,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:07,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:45:07,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:07,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2074419667, now seen corresponding path program 1 times [2025-03-03 14:45:07,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:07,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139265553] [2025-03-03 14:45:07,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:07,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:07,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:07,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:07,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:45:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:07,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139265553] [2025-03-03 14:45:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139265553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:07,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:07,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401897448] [2025-03-03 14:45:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:07,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:07,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:07,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:07,488 INFO L87 Difference]: Start difference. First operand 1321 states and 1912 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:08,044 INFO L93 Difference]: Finished difference Result 4123 states and 6082 transitions. [2025-03-03 14:45:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:08,061 INFO L225 Difference]: With dead ends: 4123 [2025-03-03 14:45:08,061 INFO L226 Difference]: Without dead ends: 2813 [2025-03-03 14:45:08,067 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-03 14:45:08,068 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 459 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:08,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1073 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2025-03-03 14:45:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2538. [2025-03-03 14:45:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2185 states have (on average 1.4443935926773455) internal successors, (3156), 2252 states have internal predecessors, (3156), 184 states have call successors, (184), 102 states have call predecessors, (184), 168 states have return successors, (440), 199 states have call predecessors, (440), 184 states have call successors, (440) [2025-03-03 14:45:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3780 transitions. [2025-03-03 14:45:08,293 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3780 transitions. Word has length 79 [2025-03-03 14:45:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:08,293 INFO L471 AbstractCegarLoop]: Abstraction has 2538 states and 3780 transitions. [2025-03-03 14:45:08,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3780 transitions. [2025-03-03 14:45:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:08,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:08,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:08,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:45:08,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:08,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash 266572146, now seen corresponding path program 1 times [2025-03-03 14:45:08,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:08,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622692787] [2025-03-03 14:45:08,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:08,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:08,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:08,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:08,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:08,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:08,378 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-03 14:45:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622692787] [2025-03-03 14:45:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622692787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:08,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938948191] [2025-03-03 14:45:08,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:08,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:08,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:08,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:08,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:08,380 INFO L87 Difference]: Start difference. First operand 2538 states and 3780 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:08,949 INFO L93 Difference]: Finished difference Result 7962 states and 12244 transitions. [2025-03-03 14:45:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:08,980 INFO L225 Difference]: With dead ends: 7962 [2025-03-03 14:45:08,981 INFO L226 Difference]: Without dead ends: 5435 [2025-03-03 14:45:08,989 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-03 14:45:08,990 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 424 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:08,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1061 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:45:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5435 states. [2025-03-03 14:45:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5435 to 5099. [2025-03-03 14:45:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 4352 states have (on average 1.4448529411764706) internal successors, (6288), 4565 states have internal predecessors, (6288), 336 states have call successors, (336), 198 states have call predecessors, (336), 410 states have return successors, (1360), 367 states have call predecessors, (1360), 336 states have call successors, (1360) [2025-03-03 14:45:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 7984 transitions. [2025-03-03 14:45:09,292 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 7984 transitions. Word has length 79 [2025-03-03 14:45:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:09,292 INFO L471 AbstractCegarLoop]: Abstraction has 5099 states and 7984 transitions. [2025-03-03 14:45:09,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 7984 transitions. [2025-03-03 14:45:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:09,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:09,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:09,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:45:09,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:09,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash -900124173, now seen corresponding path program 1 times [2025-03-03 14:45:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:09,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901757643] [2025-03-03 14:45:09,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:09,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:09,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:09,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:09,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:09,372 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-03 14:45:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901757643] [2025-03-03 14:45:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901757643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:09,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547744296] [2025-03-03 14:45:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:09,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:09,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:09,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:09,374 INFO L87 Difference]: Start difference. First operand 5099 states and 7984 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:10,216 INFO L93 Difference]: Finished difference Result 15829 states and 26290 transitions. [2025-03-03 14:45:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 14:45:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:10,271 INFO L225 Difference]: With dead ends: 15829 [2025-03-03 14:45:10,272 INFO L226 Difference]: Without dead ends: 10741 [2025-03-03 14:45:10,285 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-03 14:45:10,285 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 389 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:10,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1049 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10741 states. [2025-03-03 14:45:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10741 to 10392. [2025-03-03 14:45:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10392 states, 8727 states have (on average 1.4318780795233184) internal successors, (12496), 9394 states have internal predecessors, (12496), 616 states have call successors, (616), 382 states have call predecessors, (616), 1048 states have return successors, (4712), 679 states have call predecessors, (4712), 616 states have call successors, (4712) [2025-03-03 14:45:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10392 states to 10392 states and 17824 transitions. [2025-03-03 14:45:10,923 INFO L78 Accepts]: Start accepts. Automaton has 10392 states and 17824 transitions. Word has length 79 [2025-03-03 14:45:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:10,924 INFO L471 AbstractCegarLoop]: Abstraction has 10392 states and 17824 transitions. [2025-03-03 14:45:10,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-03 14:45:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10392 states and 17824 transitions. [2025-03-03 14:45:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:10,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:10,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:10,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:45:10,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:10,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -799212206, now seen corresponding path program 1 times [2025-03-03 14:45:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:10,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698549664] [2025-03-03 14:45:10,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:10,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:10,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:10,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:10,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:10,978 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-03 14:45:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:10,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698549664] [2025-03-03 14:45:10,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698549664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:10,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:10,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457946290] [2025-03-03 14:45:10,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:10,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:10,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:10,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:10,980 INFO L87 Difference]: Start difference. First operand 10392 states and 17824 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:11,481 INFO L93 Difference]: Finished difference Result 20775 states and 35857 transitions. [2025-03-03 14:45:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:11,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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 79 [2025-03-03 14:45:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:11,555 INFO L225 Difference]: With dead ends: 20775 [2025-03-03 14:45:11,555 INFO L226 Difference]: Without dead ends: 10395 [2025-03-03 14:45:11,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:11,593 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:11,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10395 states. [2025-03-03 14:45:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10395 to 10395. [2025-03-03 14:45:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10395 states, 8730 states have (on average 1.4243986254295533) internal successors, (12435), 9397 states have internal predecessors, (12435), 616 states have call successors, (616), 382 states have call predecessors, (616), 1048 states have return successors, (4712), 679 states have call predecessors, (4712), 616 states have call successors, (4712) [2025-03-03 14:45:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10395 states to 10395 states and 17763 transitions. [2025-03-03 14:45:12,315 INFO L78 Accepts]: Start accepts. Automaton has 10395 states and 17763 transitions. Word has length 79 [2025-03-03 14:45:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:12,315 INFO L471 AbstractCegarLoop]: Abstraction has 10395 states and 17763 transitions. [2025-03-03 14:45:12,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 10395 states and 17763 transitions. [2025-03-03 14:45:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:12,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:12,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:12,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:45:12,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 333978387, now seen corresponding path program 1 times [2025-03-03 14:45:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365966532] [2025-03-03 14:45:12,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:12,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:12,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:12,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:12,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:12,387 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-03 14:45:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365966532] [2025-03-03 14:45:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365966532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783816766] [2025-03-03 14:45:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:12,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:12,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:12,389 INFO L87 Difference]: Start difference. First operand 10395 states and 17763 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:13,676 INFO L93 Difference]: Finished difference Result 46888 states and 80731 transitions. [2025-03-03 14:45:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:45:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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 79 [2025-03-03 14:45:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:13,849 INFO L225 Difference]: With dead ends: 46888 [2025-03-03 14:45:13,849 INFO L226 Difference]: Without dead ends: 36505 [2025-03-03 14:45:13,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:45:13,896 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 1018 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:13,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 908 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:45:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36505 states. [2025-03-03 14:45:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36505 to 33357. [2025-03-03 14:45:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33357 states, 28003 states have (on average 1.4278827268506946) internal successors, (39985), 30005 states have internal predecessors, (39985), 2059 states have call successors, (2059), 1326 states have call predecessors, (2059), 3294 states have return successors, (13538), 2089 states have call predecessors, (13538), 2059 states have call successors, (13538) [2025-03-03 14:45:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33357 states to 33357 states and 55582 transitions. [2025-03-03 14:45:16,263 INFO L78 Accepts]: Start accepts. Automaton has 33357 states and 55582 transitions. Word has length 79 [2025-03-03 14:45:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:16,263 INFO L471 AbstractCegarLoop]: Abstraction has 33357 states and 55582 transitions. [2025-03-03 14:45:16,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 33357 states and 55582 transitions. [2025-03-03 14:45:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:16,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:16,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:16,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:45:16,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:16,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:16,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1612943018, now seen corresponding path program 1 times [2025-03-03 14:45:16,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157914393] [2025-03-03 14:45:16,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:16,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:16,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:16,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:16,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:16,328 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-03 14:45:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157914393] [2025-03-03 14:45:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157914393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895761534] [2025-03-03 14:45:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:16,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:16,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:16,330 INFO L87 Difference]: Start difference. First operand 33357 states and 55582 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:17,385 INFO L93 Difference]: Finished difference Result 66996 states and 112591 transitions. [2025-03-03 14:45:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:17,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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 79 [2025-03-03 14:45:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:17,543 INFO L225 Difference]: With dead ends: 66996 [2025-03-03 14:45:17,543 INFO L226 Difference]: Without dead ends: 33651 [2025-03-03 14:45:17,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:17,622 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:17,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33651 states. [2025-03-03 14:45:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33651 to 33651. [2025-03-03 14:45:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33651 states, 28297 states have (on average 1.4188076474537936) internal successors, (40148), 30299 states have internal predecessors, (40148), 2059 states have call successors, (2059), 1326 states have call predecessors, (2059), 3294 states have return successors, (13538), 2089 states have call predecessors, (13538), 2059 states have call successors, (13538) [2025-03-03 14:45:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33651 states to 33651 states and 55745 transitions. [2025-03-03 14:45:19,752 INFO L78 Accepts]: Start accepts. Automaton has 33651 states and 55745 transitions. Word has length 79 [2025-03-03 14:45:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:19,753 INFO L471 AbstractCegarLoop]: Abstraction has 33651 states and 55745 transitions. [2025-03-03 14:45:19,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33651 states and 55745 transitions. [2025-03-03 14:45:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:19,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:19,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:19,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:45:19,763 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 981283799, now seen corresponding path program 1 times [2025-03-03 14:45:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566723682] [2025-03-03 14:45:19,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:19,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:19,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:19,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:19,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:45:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566723682] [2025-03-03 14:45:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566723682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:45:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656800434] [2025-03-03 14:45:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:19,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:45:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:19,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:45:19,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:19,816 INFO L87 Difference]: Start difference. First operand 33651 states and 55745 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:22,768 INFO L93 Difference]: Finished difference Result 99972 states and 166517 transitions. [2025-03-03 14:45:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:45:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 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 79 [2025-03-03 14:45:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:23,035 INFO L225 Difference]: With dead ends: 99972 [2025-03-03 14:45:23,036 INFO L226 Difference]: Without dead ends: 66333 [2025-03-03 14:45:23,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:23,119 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 395 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:23,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 765 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:45:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66333 states. [2025-03-03 14:45:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66333 to 65643. [2025-03-03 14:45:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65643 states, 55155 states have (on average 1.4130722509291995) internal successors, (77938), 59158 states have internal predecessors, (77938), 3948 states have call successors, (3948), 2603 states have call predecessors, (3948), 6539 states have return successors, (26742), 3945 states have call predecessors, (26742), 3948 states have call successors, (26742) [2025-03-03 14:45:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65643 states to 65643 states and 108628 transitions. [2025-03-03 14:45:27,001 INFO L78 Accepts]: Start accepts. Automaton has 65643 states and 108628 transitions. Word has length 79 [2025-03-03 14:45:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:27,001 INFO L471 AbstractCegarLoop]: Abstraction has 65643 states and 108628 transitions. [2025-03-03 14:45:27,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 65643 states and 108628 transitions. [2025-03-03 14:45:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:27,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:27,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:27,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:45:27,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:27,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:27,009 INFO L85 PathProgramCache]: Analyzing trace with hash 284440666, now seen corresponding path program 1 times [2025-03-03 14:45:27,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:27,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678285275] [2025-03-03 14:45:27,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:27,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:27,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:27,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:27,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:27,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:27,059 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-03 14:45:27,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:27,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678285275] [2025-03-03 14:45:27,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678285275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:27,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:27,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:27,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060305599] [2025-03-03 14:45:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:27,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:27,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:27,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:27,062 INFO L87 Difference]: Start difference. First operand 65643 states and 108628 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:29,743 INFO L93 Difference]: Finished difference Result 131961 states and 219992 transitions. [2025-03-03 14:45:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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 79 [2025-03-03 14:45:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:30,079 INFO L225 Difference]: With dead ends: 131961 [2025-03-03 14:45:30,079 INFO L226 Difference]: Without dead ends: 66330 [2025-03-03 14:45:30,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:30,460 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:30,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 882 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66330 states. [2025-03-03 14:45:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66330 to 66330. [2025-03-03 14:45:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66330 states, 55842 states have (on average 1.4038895455033846) internal successors, (78396), 59845 states have internal predecessors, (78396), 3948 states have call successors, (3948), 2603 states have call predecessors, (3948), 6539 states have return successors, (26742), 3945 states have call predecessors, (26742), 3948 states have call successors, (26742) [2025-03-03 14:45:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66330 states to 66330 states and 109086 transitions. [2025-03-03 14:45:33,625 INFO L78 Accepts]: Start accepts. Automaton has 66330 states and 109086 transitions. Word has length 79 [2025-03-03 14:45:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:33,626 INFO L471 AbstractCegarLoop]: Abstraction has 66330 states and 109086 transitions. [2025-03-03 14:45:33,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 1 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-03 14:45:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 66330 states and 109086 transitions. [2025-03-03 14:45:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:45:33,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:33,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:33,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:45:33,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:33,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash -638242917, now seen corresponding path program 1 times [2025-03-03 14:45:33,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:33,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913804106] [2025-03-03 14:45:33,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:33,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:45:33,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:45:33,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:33,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:33,673 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-03 14:45:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913804106] [2025-03-03 14:45:33,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913804106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:33,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:33,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:45:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499383491] [2025-03-03 14:45:33,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:33,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:45:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:33,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:45:33,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:33,675 INFO L87 Difference]: Start difference. First operand 66330 states and 109086 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)