./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.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 dbee9cda36a67f6e027f5c3662c75509e745ea501d7248f54e8e93f6e2072cf5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:23:15,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:23:15,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:23:15,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:23:15,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:23:15,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:23:15,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:23:15,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:23:15,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:23:15,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:23:15,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:23:15,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:23:15,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:23:15,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:23:15,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:23:15,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:23:15,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:23:15,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:23:15,417 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 -> dbee9cda36a67f6e027f5c3662c75509e745ea501d7248f54e8e93f6e2072cf5 [2025-03-08 07:23:15,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:23:15,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:23:15,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:23:15,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:23:15,623 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:23:15,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-08 07:23:16,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6109713d/9c6af48da3d346c7a09665ab1e8bdf65/FLAGd8585f317 [2025-03-08 07:23:17,173 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:23:17,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-08 07:23:17,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6109713d/9c6af48da3d346c7a09665ab1e8bdf65/FLAGd8585f317 [2025-03-08 07:23:17,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6109713d/9c6af48da3d346c7a09665ab1e8bdf65 [2025-03-08 07:23:17,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:23:17,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:23:17,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:23:17,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:23:17,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:23:17,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:23:17" (1/1) ... [2025-03-08 07:23:17,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fdc8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:17, skipping insertion in model container [2025-03-08 07:23:17,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:23:17" (1/1) ... [2025-03-08 07:23:17,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:23:17,675 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/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c[15547,15560] [2025-03-08 07:23:17,740 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/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c[22837,22850] [2025-03-08 07:23:18,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:23:18,121 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:23:18,154 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/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c[15547,15560] [2025-03-08 07:23:18,165 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/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c[22837,22850] [2025-03-08 07:23:18,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:23:18,412 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:23:18,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18 WrapperNode [2025-03-08 07:23:18,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:23:18,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:23:18,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:23:18,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:23:18,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:18,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:18,736 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5152 [2025-03-08 07:23:18,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:23:18,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:23:18,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:23:18,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:23:18,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:18,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:18,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:18,922 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:23:18,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:18,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:18,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:19,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:19,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:19,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:19,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:23:19,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:23:19,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:23:19,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:23:19,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (1/1) ... [2025-03-08 07:23:19,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:23:19,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:23:19,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:23:19,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:23:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:23:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:23:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:23:19,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:23:19,201 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:23:19,203 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:23:22,537 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc calculate_output2_#t~ret42#1; [2025-03-08 07:23:22,538 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5177: havoc calculate_output3_#t~ret43#1; [2025-03-08 07:23:22,538 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: havoc calculate_output_#t~ret41#1; [2025-03-08 07:23:22,671 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-03-08 07:23:22,671 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:23:22,705 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:23:22,706 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:23:22,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:23:22 BoogieIcfgContainer [2025-03-08 07:23:22,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:23:22,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:23:22,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:23:22,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:23:22,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:23:17" (1/3) ... [2025-03-08 07:23:22,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659efd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:23:22, skipping insertion in model container [2025-03-08 07:23:22,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:23:18" (2/3) ... [2025-03-08 07:23:22,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659efd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:23:22, skipping insertion in model container [2025-03-08 07:23:22,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:23:22" (3/3) ... [2025-03-08 07:23:22,715 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-03-08 07:23:22,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:23:22,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 915 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:23:22,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:23:22,801 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;@4ae40e73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:23:22,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:23:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 07:23:22,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:22,812 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] [2025-03-08 07:23:22,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:22,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1738102833, now seen corresponding path program 1 times [2025-03-08 07:23:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:22,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099598830] [2025-03-08 07:23:22,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:22,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 07:23:22,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 07:23:22,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:22,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:23,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099598830] [2025-03-08 07:23:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099598830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:23,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:23:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895866584] [2025-03-08 07:23:23,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:23:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:23,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:23:23,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:23:23,050 INFO L87 Difference]: Start difference. First operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:23,132 INFO L93 Difference]: Finished difference Result 1783 states and 3381 transitions. [2025-03-08 07:23:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:23:23,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 07:23:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:23,149 INFO L225 Difference]: With dead ends: 1783 [2025-03-08 07:23:23,152 INFO L226 Difference]: Without dead ends: 850 [2025-03-08 07:23:23,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:23:23,163 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:23,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-08 07:23:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-03-08 07:23:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.892688679245283) internal successors, (1605), 849 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1605 transitions. [2025-03-08 07:23:23,251 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1605 transitions. Word has length 26 [2025-03-08 07:23:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:23,251 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1605 transitions. [2025-03-08 07:23:23,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1605 transitions. [2025-03-08 07:23:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 07:23:23,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:23,253 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] [2025-03-08 07:23:23,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:23:23,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:23,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2146927058, now seen corresponding path program 1 times [2025-03-08 07:23:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595063941] [2025-03-08 07:23:23,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:23,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 07:23:23,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 07:23:23,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:23,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595063941] [2025-03-08 07:23:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595063941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:23:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390071176] [2025-03-08 07:23:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:23,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:23:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:23,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:23:23,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:23:23,473 INFO L87 Difference]: Start difference. First operand 850 states and 1605 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:23,595 INFO L93 Difference]: Finished difference Result 904 states and 1689 transitions. [2025-03-08 07:23:23,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:23:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 07:23:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:23,598 INFO L225 Difference]: With dead ends: 904 [2025-03-08 07:23:23,598 INFO L226 Difference]: Without dead ends: 850 [2025-03-08 07:23:23,599 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-08 07:23:23,599 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:23,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-08 07:23:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-03-08 07:23:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.8455188679245282) internal successors, (1565), 849 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1565 transitions. [2025-03-08 07:23:23,627 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1565 transitions. Word has length 26 [2025-03-08 07:23:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:23,627 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1565 transitions. [2025-03-08 07:23:23,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1565 transitions. [2025-03-08 07:23:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:23:23,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:23,632 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] [2025-03-08 07:23:23,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:23:23,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:23,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:23,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1257608309, now seen corresponding path program 1 times [2025-03-08 07:23:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634842426] [2025-03-08 07:23:23,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:23,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:23:23,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:23:23,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:23,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634842426] [2025-03-08 07:23:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634842426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:23,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:23,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496873055] [2025-03-08 07:23:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:23,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:23:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:23,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:23:23,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:23:23,912 INFO L87 Difference]: Start difference. First operand 850 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:28,420 INFO L93 Difference]: Finished difference Result 3105 states and 5874 transitions. [2025-03-08 07:23:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:23:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 07:23:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:28,434 INFO L225 Difference]: With dead ends: 3105 [2025-03-08 07:23:28,434 INFO L226 Difference]: Without dead ends: 2352 [2025-03-08 07:23:28,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:23:28,435 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 2445 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2445 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:28,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2445 Valid, 837 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 07:23:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2025-03-08 07:23:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2025-03-08 07:23:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2350 states have (on average 1.5068085106382978) internal successors, (3541), 2351 states have internal predecessors, (3541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3541 transitions. [2025-03-08 07:23:28,489 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3541 transitions. Word has length 63 [2025-03-08 07:23:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:28,490 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3541 transitions. [2025-03-08 07:23:28,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3541 transitions. [2025-03-08 07:23:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:23:28,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:28,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:28,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:23:28,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:28,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1878112614, now seen corresponding path program 1 times [2025-03-08 07:23:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991534239] [2025-03-08 07:23:28,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:28,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:23:28,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:23:28,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:28,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:28,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991534239] [2025-03-08 07:23:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991534239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:28,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16616801] [2025-03-08 07:23:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:28,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:28,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:28,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:28,655 INFO L87 Difference]: Start difference. First operand 2352 states and 3541 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:28,851 INFO L93 Difference]: Finished difference Result 2952 states and 4501 transitions. [2025-03-08 07:23:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 07:23:28,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 07:23:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:28,860 INFO L225 Difference]: With dead ends: 2952 [2025-03-08 07:23:28,860 INFO L226 Difference]: Without dead ends: 2902 [2025-03-08 07:23:28,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-08 07:23:28,862 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 9729 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9729 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:28,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9729 Valid, 3527 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2025-03-08 07:23:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2400. [2025-03-08 07:23:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2398 states have (on average 1.5087572977481234) internal successors, (3618), 2399 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3618 transitions. [2025-03-08 07:23:28,911 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3618 transitions. Word has length 65 [2025-03-08 07:23:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3618 transitions. [2025-03-08 07:23:28,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3618 transitions. [2025-03-08 07:23:28,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:23:28,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:28,914 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] [2025-03-08 07:23:28,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:23:28,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:28,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash 140395509, now seen corresponding path program 1 times [2025-03-08 07:23:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:28,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978439199] [2025-03-08 07:23:28,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:28,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:23:28,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:23:28,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:28,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:29,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:29,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978439199] [2025-03-08 07:23:29,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978439199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:29,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:29,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49380800] [2025-03-08 07:23:29,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:29,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:29,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:29,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:29,027 INFO L87 Difference]: Start difference. First operand 2400 states and 3618 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:29,054 INFO L93 Difference]: Finished difference Result 2585 states and 3913 transitions. [2025-03-08 07:23:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 07:23:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:29,062 INFO L225 Difference]: With dead ends: 2585 [2025-03-08 07:23:29,063 INFO L226 Difference]: Without dead ends: 2487 [2025-03-08 07:23:29,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:29,064 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1492 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:29,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1634 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-03-08 07:23:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2483. [2025-03-08 07:23:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5106811769447803) internal successors, (3748), 2482 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3748 transitions. [2025-03-08 07:23:29,104 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3748 transitions. Word has length 67 [2025-03-08 07:23:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:29,104 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3748 transitions. [2025-03-08 07:23:29,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3748 transitions. [2025-03-08 07:23:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:23:29,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:29,105 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] [2025-03-08 07:23:29,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:23:29,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:29,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash 172718744, now seen corresponding path program 1 times [2025-03-08 07:23:29,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:29,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789719374] [2025-03-08 07:23:29,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:29,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:29,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:23:29,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:23:29,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:29,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:29,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789719374] [2025-03-08 07:23:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789719374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:29,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881687996] [2025-03-08 07:23:29,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:29,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:29,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:29,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:29,365 INFO L87 Difference]: Start difference. First operand 2483 states and 3748 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:29,543 INFO L93 Difference]: Finished difference Result 2666 states and 4036 transitions. [2025-03-08 07:23:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 07:23:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:29,552 INFO L225 Difference]: With dead ends: 2666 [2025-03-08 07:23:29,552 INFO L226 Difference]: Without dead ends: 2485 [2025-03-08 07:23:29,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:23:29,557 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 7515 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7515 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:29,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7515 Valid, 1941 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-08 07:23:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2483. [2025-03-08 07:23:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5098750503829101) internal successors, (3746), 2482 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3746 transitions. [2025-03-08 07:23:29,600 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3746 transitions. Word has length 67 [2025-03-08 07:23:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3746 transitions. [2025-03-08 07:23:29,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3746 transitions. [2025-03-08 07:23:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:23:29,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:29,602 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] [2025-03-08 07:23:29,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:23:29,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:29,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1089851502, now seen corresponding path program 1 times [2025-03-08 07:23:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102697795] [2025-03-08 07:23:29,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:29,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:23:29,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:23:29,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:29,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:29,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102697795] [2025-03-08 07:23:29,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102697795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:29,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626912154] [2025-03-08 07:23:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:29,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:29,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:29,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:29,869 INFO L87 Difference]: Start difference. First operand 2483 states and 3746 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:29,921 INFO L93 Difference]: Finished difference Result 2491 states and 3755 transitions. [2025-03-08 07:23:29,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-08 07:23:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:29,928 INFO L225 Difference]: With dead ends: 2491 [2025-03-08 07:23:29,929 INFO L226 Difference]: Without dead ends: 2489 [2025-03-08 07:23:29,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:29,930 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 9341 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:29,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10900 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-03-08 07:23:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2489. [2025-03-08 07:23:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 1.5082428628870124) internal successors, (3751), 2488 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3751 transitions. [2025-03-08 07:23:29,968 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3751 transitions. Word has length 68 [2025-03-08 07:23:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:29,968 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3751 transitions. [2025-03-08 07:23:29,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3751 transitions. [2025-03-08 07:23:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:23:29,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:29,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:29,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:23:29,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:29,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1188896010, now seen corresponding path program 1 times [2025-03-08 07:23:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:29,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646651011] [2025-03-08 07:23:29,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:29,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:23:29,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:23:29,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646651011] [2025-03-08 07:23:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646651011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009090091] [2025-03-08 07:23:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:30,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:30,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:30,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,013 INFO L87 Difference]: Start difference. First operand 2489 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:30,035 INFO L93 Difference]: Finished difference Result 2847 states and 4303 transitions. [2025-03-08 07:23:30,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:30,036 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 07:23:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:30,043 INFO L225 Difference]: With dead ends: 2847 [2025-03-08 07:23:30,043 INFO L226 Difference]: Without dead ends: 2660 [2025-03-08 07:23:30,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,044 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1507 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:30,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-08 07:23:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2658. [2025-03-08 07:23:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2656 states have (on average 1.5090361445783131) internal successors, (4008), 2657 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4008 transitions. [2025-03-08 07:23:30,082 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4008 transitions. Word has length 69 [2025-03-08 07:23:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4008 transitions. [2025-03-08 07:23:30,083 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4008 transitions. [2025-03-08 07:23:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:23:30,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:30,083 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] [2025-03-08 07:23:30,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:23:30,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2127140790, now seen corresponding path program 1 times [2025-03-08 07:23:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:30,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545617056] [2025-03-08 07:23:30,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:30,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:23:30,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:23:30,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:30,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:30,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:30,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545617056] [2025-03-08 07:23:30,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545617056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:30,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:30,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350200543] [2025-03-08 07:23:30,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:30,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:30,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:30,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,127 INFO L87 Difference]: Start difference. First operand 2658 states and 4008 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:30,151 INFO L93 Difference]: Finished difference Result 3338 states and 5046 transitions. [2025-03-08 07:23:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:30,152 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 07:23:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:30,159 INFO L225 Difference]: With dead ends: 3338 [2025-03-08 07:23:30,159 INFO L226 Difference]: Without dead ends: 2982 [2025-03-08 07:23:30,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,161 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1505 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:30,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-03-08 07:23:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2980. [2025-03-08 07:23:30,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2978 states have (on average 1.5077233042310276) internal successors, (4490), 2979 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4490 transitions. [2025-03-08 07:23:30,203 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4490 transitions. Word has length 69 [2025-03-08 07:23:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:30,203 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4490 transitions. [2025-03-08 07:23:30,203 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4490 transitions. [2025-03-08 07:23:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:23:30,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:30,204 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] [2025-03-08 07:23:30,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:23:30,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:30,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1679195254, now seen corresponding path program 1 times [2025-03-08 07:23:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:30,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606277190] [2025-03-08 07:23:30,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:30,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:30,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:23:30,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:23:30,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:30,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606277190] [2025-03-08 07:23:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606277190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:30,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:30,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979689120] [2025-03-08 07:23:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:30,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:30,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:30,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,247 INFO L87 Difference]: Start difference. First operand 2980 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:30,275 INFO L93 Difference]: Finished difference Result 4272 states and 6436 transitions. [2025-03-08 07:23:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:30,275 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 07:23:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:30,284 INFO L225 Difference]: With dead ends: 4272 [2025-03-08 07:23:30,284 INFO L226 Difference]: Without dead ends: 3594 [2025-03-08 07:23:30,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,286 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1503 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:30,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-03-08 07:23:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2025-03-08 07:23:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3590 states have (on average 1.501392757660167) internal successors, (5390), 3591 states have internal predecessors, (5390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5390 transitions. [2025-03-08 07:23:30,337 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5390 transitions. Word has length 69 [2025-03-08 07:23:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:30,338 INFO L471 AbstractCegarLoop]: Abstraction has 3592 states and 5390 transitions. [2025-03-08 07:23:30,338 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5390 transitions. [2025-03-08 07:23:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:23:30,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:30,339 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] [2025-03-08 07:23:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:23:30,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:30,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2094371126, now seen corresponding path program 1 times [2025-03-08 07:23:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:30,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338991869] [2025-03-08 07:23:30,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:30,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:23:30,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:23:30,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:30,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:30,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338991869] [2025-03-08 07:23:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338991869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:30,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726626501] [2025-03-08 07:23:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:30,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:30,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:30,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,378 INFO L87 Difference]: Start difference. First operand 3592 states and 5390 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:30,418 INFO L93 Difference]: Finished difference Result 6044 states and 9024 transitions. [2025-03-08 07:23:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:30,418 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 07:23:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:30,428 INFO L225 Difference]: With dead ends: 6044 [2025-03-08 07:23:30,429 INFO L226 Difference]: Without dead ends: 4754 [2025-03-08 07:23:30,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,432 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1501 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:30,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2025-03-08 07:23:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4752. [2025-03-08 07:23:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4750 states have (on average 1.4867368421052631) internal successors, (7062), 4751 states have internal predecessors, (7062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 7062 transitions. [2025-03-08 07:23:30,512 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 7062 transitions. Word has length 69 [2025-03-08 07:23:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:30,513 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 7062 transitions. [2025-03-08 07:23:30,513 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 7062 transitions. [2025-03-08 07:23:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:23:30,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:30,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:30,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:23:30,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:30,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1607652854, now seen corresponding path program 1 times [2025-03-08 07:23:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005121888] [2025-03-08 07:23:30,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:30,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:23:30,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:23:30,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:30,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:30,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005121888] [2025-03-08 07:23:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005121888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:30,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:30,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899731084] [2025-03-08 07:23:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:30,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:30,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:30,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,560 INFO L87 Difference]: Start difference. First operand 4752 states and 7062 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:30,619 INFO L93 Difference]: Finished difference Result 9396 states and 13816 transitions. [2025-03-08 07:23:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:30,620 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-08 07:23:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:30,632 INFO L225 Difference]: With dead ends: 9396 [2025-03-08 07:23:30,633 INFO L226 Difference]: Without dead ends: 6946 [2025-03-08 07:23:30,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,638 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1499 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:30,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-03-08 07:23:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6944. [2025-03-08 07:23:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6944 states, 6942 states have (on average 1.4621146643618554) internal successors, (10150), 6943 states have internal predecessors, (10150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6944 states to 6944 states and 10150 transitions. [2025-03-08 07:23:30,793 INFO L78 Accepts]: Start accepts. Automaton has 6944 states and 10150 transitions. Word has length 69 [2025-03-08 07:23:30,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:30,794 INFO L471 AbstractCegarLoop]: Abstraction has 6944 states and 10150 transitions. [2025-03-08 07:23:30,794 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6944 states and 10150 transitions. [2025-03-08 07:23:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:23:30,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:30,794 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] [2025-03-08 07:23:30,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:23:30,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:30,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1834425366, now seen corresponding path program 1 times [2025-03-08 07:23:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658408798] [2025-03-08 07:23:30,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:30,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 07:23:30,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:23:30,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:30,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:30,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:30,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658408798] [2025-03-08 07:23:30,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658408798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:30,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:30,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396365211] [2025-03-08 07:23:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:30,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:30,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:30,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,835 INFO L87 Difference]: Start difference. First operand 6944 states and 10150 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:30,907 INFO L93 Difference]: Finished difference Result 11815 states and 17260 transitions. [2025-03-08 07:23:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-08 07:23:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:30,922 INFO L225 Difference]: With dead ends: 11815 [2025-03-08 07:23:30,922 INFO L226 Difference]: Without dead ends: 9188 [2025-03-08 07:23:30,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:30,928 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1506 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:30,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9188 states. [2025-03-08 07:23:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9188 to 9186. [2025-03-08 07:23:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9186 states, 9184 states have (on average 1.4503484320557491) internal successors, (13320), 9185 states have internal predecessors, (13320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9186 states to 9186 states and 13320 transitions. [2025-03-08 07:23:31,080 INFO L78 Accepts]: Start accepts. Automaton has 9186 states and 13320 transitions. Word has length 71 [2025-03-08 07:23:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:31,081 INFO L471 AbstractCegarLoop]: Abstraction has 9186 states and 13320 transitions. [2025-03-08 07:23:31,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9186 states and 13320 transitions. [2025-03-08 07:23:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 07:23:31,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:31,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:31,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:23:31,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:31,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash -65687301, now seen corresponding path program 1 times [2025-03-08 07:23:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039147360] [2025-03-08 07:23:31,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:31,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:23:31,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:23:31,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:31,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:23:31,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039147360] [2025-03-08 07:23:31,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039147360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:31,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:31,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444924445] [2025-03-08 07:23:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:31,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:31,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:31,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:31,233 INFO L87 Difference]: Start difference. First operand 9186 states and 13320 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:31,900 INFO L93 Difference]: Finished difference Result 51920 states and 74447 transitions. [2025-03-08 07:23:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 07:23:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:31,966 INFO L225 Difference]: With dead ends: 51920 [2025-03-08 07:23:31,966 INFO L226 Difference]: Without dead ends: 45038 [2025-03-08 07:23:31,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:23:31,986 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 8052 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8052 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:31,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8052 Valid, 4044 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45038 states. [2025-03-08 07:23:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45038 to 16066. [2025-03-08 07:23:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16066 states, 16064 states have (on average 1.4367529880478087) internal successors, (23080), 16065 states have internal predecessors, (23080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16066 states to 16066 states and 23080 transitions. [2025-03-08 07:23:32,464 INFO L78 Accepts]: Start accepts. Automaton has 16066 states and 23080 transitions. Word has length 90 [2025-03-08 07:23:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:32,464 INFO L471 AbstractCegarLoop]: Abstraction has 16066 states and 23080 transitions. [2025-03-08 07:23:32,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 16066 states and 23080 transitions. [2025-03-08 07:23:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 07:23:32,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:32,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:32,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:23:32,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:32,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1044617797, now seen corresponding path program 1 times [2025-03-08 07:23:32,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:32,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807840119] [2025-03-08 07:23:32,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:32,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:23:32,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:23:32,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:32,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:23:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807840119] [2025-03-08 07:23:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807840119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:32,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753950577] [2025-03-08 07:23:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:32,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:32,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:32,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:32,609 INFO L87 Difference]: Start difference. First operand 16066 states and 23080 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:33,270 INFO L93 Difference]: Finished difference Result 58800 states and 84207 transitions. [2025-03-08 07:23:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:33,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 07:23:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:33,355 INFO L225 Difference]: With dead ends: 58800 [2025-03-08 07:23:33,356 INFO L226 Difference]: Without dead ends: 51918 [2025-03-08 07:23:33,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:23:33,371 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8073 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8073 SdHoareTripleChecker+Valid, 3964 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:33,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8073 Valid, 3964 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51918 states. [2025-03-08 07:23:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51918 to 26402. [2025-03-08 07:23:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26402 states, 26400 states have (on average 1.4257575757575758) internal successors, (37640), 26401 states have internal predecessors, (37640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26402 states to 26402 states and 37640 transitions. [2025-03-08 07:23:34,009 INFO L78 Accepts]: Start accepts. Automaton has 26402 states and 37640 transitions. Word has length 90 [2025-03-08 07:23:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:34,009 INFO L471 AbstractCegarLoop]: Abstraction has 26402 states and 37640 transitions. [2025-03-08 07:23:34,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 26402 states and 37640 transitions. [2025-03-08 07:23:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 07:23:34,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:34,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:34,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:23:34,012 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:34,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1492563333, now seen corresponding path program 1 times [2025-03-08 07:23:34,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:34,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159670411] [2025-03-08 07:23:34,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:34,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:23:34,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:23:34,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:23:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159670411] [2025-03-08 07:23:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159670411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020746760] [2025-03-08 07:23:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:34,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:34,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:34,135 INFO L87 Difference]: Start difference. First operand 26402 states and 37640 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:35,287 INFO L93 Difference]: Finished difference Result 65680 states and 93967 transitions. [2025-03-08 07:23:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:35,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 07:23:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:35,364 INFO L225 Difference]: With dead ends: 65680 [2025-03-08 07:23:35,365 INFO L226 Difference]: Without dead ends: 58798 [2025-03-08 07:23:35,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:23:35,387 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 8114 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8114 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:35,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8114 Valid, 3916 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58798 states. [2025-03-08 07:23:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58798 to 33282. [2025-03-08 07:23:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33282 states, 33280 states have (on average 1.4242788461538463) internal successors, (47400), 33281 states have internal predecessors, (47400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33282 states to 33282 states and 47400 transitions. [2025-03-08 07:23:36,182 INFO L78 Accepts]: Start accepts. Automaton has 33282 states and 47400 transitions. Word has length 90 [2025-03-08 07:23:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:36,183 INFO L471 AbstractCegarLoop]: Abstraction has 33282 states and 47400 transitions. [2025-03-08 07:23:36,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33282 states and 47400 transitions. [2025-03-08 07:23:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 07:23:36,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:36,186 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:36,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:23:36,187 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:36,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:36,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1077387461, now seen corresponding path program 1 times [2025-03-08 07:23:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:36,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272044162] [2025-03-08 07:23:36,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:36,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:36,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:23:36,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:23:36,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:36,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 07:23:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:36,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272044162] [2025-03-08 07:23:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272044162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:36,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:36,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415798044] [2025-03-08 07:23:36,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:36,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:36,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:36,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:36,334 INFO L87 Difference]: Start difference. First operand 33282 states and 47400 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:37,409 INFO L93 Difference]: Finished difference Result 72560 states and 103727 transitions. [2025-03-08 07:23:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 07:23:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:37,495 INFO L225 Difference]: With dead ends: 72560 [2025-03-08 07:23:37,495 INFO L226 Difference]: Without dead ends: 65678 [2025-03-08 07:23:37,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:23:37,515 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8164 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8164 SdHoareTripleChecker+Valid, 3917 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:37,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8164 Valid, 3917 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2025-03-08 07:23:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 40162. [2025-03-08 07:23:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40162 states, 40160 states have (on average 1.4233067729083666) internal successors, (57160), 40161 states have internal predecessors, (57160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40162 states to 40162 states and 57160 transitions. [2025-03-08 07:23:38,441 INFO L78 Accepts]: Start accepts. Automaton has 40162 states and 57160 transitions. Word has length 90 [2025-03-08 07:23:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:38,441 INFO L471 AbstractCegarLoop]: Abstraction has 40162 states and 57160 transitions. [2025-03-08 07:23:38,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 40162 states and 57160 transitions. [2025-03-08 07:23:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 07:23:38,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:38,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:38,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:23:38,444 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:38,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1564105733, now seen corresponding path program 1 times [2025-03-08 07:23:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871822657] [2025-03-08 07:23:38,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:38,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:23:38,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:23:38,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:38,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:23:38,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:38,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871822657] [2025-03-08 07:23:38,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871822657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:38,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:38,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375323362] [2025-03-08 07:23:38,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:38,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:38,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:38,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:38,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:38,558 INFO L87 Difference]: Start difference. First operand 40162 states and 57160 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:39,853 INFO L93 Difference]: Finished difference Result 79440 states and 113487 transitions. [2025-03-08 07:23:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-08 07:23:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:39,928 INFO L225 Difference]: With dead ends: 79440 [2025-03-08 07:23:39,928 INFO L226 Difference]: Without dead ends: 72558 [2025-03-08 07:23:39,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:23:39,947 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8068 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8068 SdHoareTripleChecker+Valid, 4011 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:39,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8068 Valid, 4011 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72558 states. [2025-03-08 07:23:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72558 to 47042. [2025-03-08 07:23:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47042 states, 47040 states have (on average 1.4226190476190477) internal successors, (66920), 47041 states have internal predecessors, (66920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47042 states to 47042 states and 66920 transitions. [2025-03-08 07:23:41,293 INFO L78 Accepts]: Start accepts. Automaton has 47042 states and 66920 transitions. Word has length 90 [2025-03-08 07:23:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:41,294 INFO L471 AbstractCegarLoop]: Abstraction has 47042 states and 66920 transitions. [2025-03-08 07:23:41,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 47042 states and 66920 transitions. [2025-03-08 07:23:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 07:23:41,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:41,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:41,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:23:41,298 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:41,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1843277639, now seen corresponding path program 1 times [2025-03-08 07:23:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378378172] [2025-03-08 07:23:41,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:41,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 07:23:41,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 07:23:41,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:41,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378378172] [2025-03-08 07:23:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378378172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156140434] [2025-03-08 07:23:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:41,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:41,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:41,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:41,372 INFO L87 Difference]: Start difference. First operand 47042 states and 66920 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:41,947 INFO L93 Difference]: Finished difference Result 78684 states and 112289 transitions. [2025-03-08 07:23:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:41,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 07:23:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:41,985 INFO L225 Difference]: With dead ends: 78684 [2025-03-08 07:23:41,985 INFO L226 Difference]: Without dead ends: 33946 [2025-03-08 07:23:42,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:42,014 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 58 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:42,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33946 states. [2025-03-08 07:23:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33946 to 33944. [2025-03-08 07:23:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33944 states, 33942 states have (on average 1.426374403394025) internal successors, (48414), 33943 states have internal predecessors, (48414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33944 states to 33944 states and 48414 transitions. [2025-03-08 07:23:42,590 INFO L78 Accepts]: Start accepts. Automaton has 33944 states and 48414 transitions. Word has length 92 [2025-03-08 07:23:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:42,590 INFO L471 AbstractCegarLoop]: Abstraction has 33944 states and 48414 transitions. [2025-03-08 07:23:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 33944 states and 48414 transitions. [2025-03-08 07:23:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 07:23:42,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:42,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:42,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:23:42,592 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:42,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1093763877, now seen corresponding path program 1 times [2025-03-08 07:23:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996724797] [2025-03-08 07:23:42,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:42,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 07:23:42,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 07:23:42,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:42,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:23:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996724797] [2025-03-08 07:23:42,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996724797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:42,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:42,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:23:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517933064] [2025-03-08 07:23:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:42,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:23:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:42,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:23:42,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:23:42,703 INFO L87 Difference]: Start difference. First operand 33944 states and 48414 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:43,685 INFO L93 Difference]: Finished difference Result 63142 states and 90277 transitions. [2025-03-08 07:23:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:23:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 07:23:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:43,758 INFO L225 Difference]: With dead ends: 63142 [2025-03-08 07:23:43,758 INFO L226 Difference]: Without dead ends: 58276 [2025-03-08 07:23:43,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 07:23:43,777 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 8056 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8056 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:43,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8056 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:23:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58276 states. [2025-03-08 07:23:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58276 to 38808. [2025-03-08 07:23:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38808 states, 38806 states have (on average 1.4257073648404885) internal successors, (55326), 38807 states have internal predecessors, (55326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38808 states to 38808 states and 55326 transitions. [2025-03-08 07:23:44,730 INFO L78 Accepts]: Start accepts. Automaton has 38808 states and 55326 transitions. Word has length 92 [2025-03-08 07:23:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:44,730 INFO L471 AbstractCegarLoop]: Abstraction has 38808 states and 55326 transitions. [2025-03-08 07:23:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 38808 states and 55326 transitions. [2025-03-08 07:23:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 07:23:44,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:44,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:44,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:23:44,733 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:44,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash 543737427, now seen corresponding path program 1 times [2025-03-08 07:23:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005452062] [2025-03-08 07:23:44,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:44,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 07:23:44,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 07:23:44,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:44,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:44,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005452062] [2025-03-08 07:23:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005452062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:44,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:44,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:44,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204493863] [2025-03-08 07:23:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:44,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:44,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:44,815 INFO L87 Difference]: Start difference. First operand 38808 states and 55326 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:45,266 INFO L93 Difference]: Finished difference Result 57052 states and 81248 transitions. [2025-03-08 07:23:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:45,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 07:23:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:45,287 INFO L225 Difference]: With dead ends: 57052 [2025-03-08 07:23:45,288 INFO L226 Difference]: Without dead ends: 20570 [2025-03-08 07:23:45,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:45,310 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 53 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:45,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2025-03-08 07:23:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20568. [2025-03-08 07:23:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20568 states, 20566 states have (on average 1.4181659048915687) internal successors, (29166), 20567 states have internal predecessors, (29166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20568 states to 20568 states and 29166 transitions. [2025-03-08 07:23:45,833 INFO L78 Accepts]: Start accepts. Automaton has 20568 states and 29166 transitions. Word has length 93 [2025-03-08 07:23:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:45,833 INFO L471 AbstractCegarLoop]: Abstraction has 20568 states and 29166 transitions. [2025-03-08 07:23:45,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 20568 states and 29166 transitions. [2025-03-08 07:23:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 07:23:45,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:45,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:45,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:23:45,835 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1280111130, now seen corresponding path program 1 times [2025-03-08 07:23:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732303056] [2025-03-08 07:23:45,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:45,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 07:23:45,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 07:23:45,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:45,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732303056] [2025-03-08 07:23:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732303056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404841763] [2025-03-08 07:23:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:45,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:45,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:45,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:45,912 INFO L87 Difference]: Start difference. First operand 20568 states and 29166 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:46,158 INFO L93 Difference]: Finished difference Result 29692 states and 42008 transitions. [2025-03-08 07:23:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 07:23:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:46,171 INFO L225 Difference]: With dead ends: 29692 [2025-03-08 07:23:46,171 INFO L226 Difference]: Without dead ends: 11450 [2025-03-08 07:23:46,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:46,182 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 50 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:46,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2025-03-08 07:23:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 11448. [2025-03-08 07:23:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11448 states, 11446 states have (on average 1.415865804647912) internal successors, (16206), 11447 states have internal predecessors, (16206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11448 states to 11448 states and 16206 transitions. [2025-03-08 07:23:46,482 INFO L78 Accepts]: Start accepts. Automaton has 11448 states and 16206 transitions. Word has length 95 [2025-03-08 07:23:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:46,482 INFO L471 AbstractCegarLoop]: Abstraction has 11448 states and 16206 transitions. [2025-03-08 07:23:46,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 11448 states and 16206 transitions. [2025-03-08 07:23:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 07:23:46,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:46,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:46,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:23:46,484 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2035285761, now seen corresponding path program 1 times [2025-03-08 07:23:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143880781] [2025-03-08 07:23:46,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:46,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 07:23:46,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 07:23:46,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:46,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143880781] [2025-03-08 07:23:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143880781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551157023] [2025-03-08 07:23:46,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:46,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:46,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:46,560 INFO L87 Difference]: Start difference. First operand 11448 states and 16206 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:46,700 INFO L93 Difference]: Finished difference Result 16012 states and 22568 transitions. [2025-03-08 07:23:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:46,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 07:23:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:46,712 INFO L225 Difference]: With dead ends: 16012 [2025-03-08 07:23:46,712 INFO L226 Difference]: Without dead ends: 6890 [2025-03-08 07:23:46,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:46,718 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:46,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2025-03-08 07:23:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6888. [2025-03-08 07:23:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6888 states, 6886 states have (on average 1.421144350856811) internal successors, (9786), 6887 states have internal predecessors, (9786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 9786 transitions. [2025-03-08 07:23:46,942 INFO L78 Accepts]: Start accepts. Automaton has 6888 states and 9786 transitions. Word has length 97 [2025-03-08 07:23:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:46,942 INFO L471 AbstractCegarLoop]: Abstraction has 6888 states and 9786 transitions. [2025-03-08 07:23:46,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9786 transitions. [2025-03-08 07:23:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 07:23:46,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:46,943 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:46,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:23:46,943 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:46,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:46,943 INFO L85 PathProgramCache]: Analyzing trace with hash 238968072, now seen corresponding path program 1 times [2025-03-08 07:23:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580070151] [2025-03-08 07:23:46,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:46,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 07:23:46,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 07:23:46,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:46,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:46,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580070151] [2025-03-08 07:23:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580070151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342979379] [2025-03-08 07:23:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:46,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:46,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:46,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:46,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:46,993 INFO L87 Difference]: Start difference. First operand 6888 states and 9786 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:47,043 INFO L93 Difference]: Finished difference Result 9172 states and 12938 transitions. [2025-03-08 07:23:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-08 07:23:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:47,049 INFO L225 Difference]: With dead ends: 9172 [2025-03-08 07:23:47,049 INFO L226 Difference]: Without dead ends: 4610 [2025-03-08 07:23:47,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:47,052 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 44 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:47,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-08 07:23:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4608. [2025-03-08 07:23:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4606 states have (on average 1.4342162396873643) internal successors, (6606), 4607 states have internal predecessors, (6606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 6606 transitions. [2025-03-08 07:23:47,113 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 6606 transitions. Word has length 99 [2025-03-08 07:23:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:47,113 INFO L471 AbstractCegarLoop]: Abstraction has 4608 states and 6606 transitions. [2025-03-08 07:23:47,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 6606 transitions. [2025-03-08 07:23:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 07:23:47,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:47,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:23:47,115 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:47,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1556710353, now seen corresponding path program 1 times [2025-03-08 07:23:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132206150] [2025-03-08 07:23:47,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:47,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 07:23:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 07:23:47,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:47,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:47,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:47,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132206150] [2025-03-08 07:23:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132206150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:23:47,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:23:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:23:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887000963] [2025-03-08 07:23:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:23:47,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:23:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:47,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:23:47,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:47,175 INFO L87 Difference]: Start difference. First operand 4608 states and 6606 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:47,208 INFO L93 Difference]: Finished difference Result 5752 states and 8168 transitions. [2025-03-08 07:23:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:23:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 07:23:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:47,212 INFO L225 Difference]: With dead ends: 5752 [2025-03-08 07:23:47,212 INFO L226 Difference]: Without dead ends: 3470 [2025-03-08 07:23:47,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:23:47,214 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:47,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:23:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-08 07:23:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3468. [2025-03-08 07:23:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3466 states have (on average 1.451529140219273) internal successors, (5031), 3467 states have internal predecessors, (5031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 5031 transitions. [2025-03-08 07:23:47,252 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 5031 transitions. Word has length 101 [2025-03-08 07:23:47,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:47,252 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 5031 transitions. [2025-03-08 07:23:47,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 5031 transitions. [2025-03-08 07:23:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 07:23:47,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:47,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:47,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:23:47,253 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:47,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash -928461706, now seen corresponding path program 1 times [2025-03-08 07:23:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:47,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525978382] [2025-03-08 07:23:47,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:47,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:47,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 07:23:47,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 07:23:47,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:47,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525978382] [2025-03-08 07:23:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525978382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:23:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83451185] [2025-03-08 07:23:47,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:47,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:23:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:23:47,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:23:47,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:23:47,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 07:23:47,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 07:23:47,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:47,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:47,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 07:23:47,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:23:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:48,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:23:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:48,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83451185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:23:48,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:23:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-08 07:23:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682346493] [2025-03-08 07:23:48,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:23:48,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:23:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:48,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:23:48,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:23:48,513 INFO L87 Difference]: Start difference. First operand 3468 states and 5031 transitions. Second operand has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:52,173 INFO L93 Difference]: Finished difference Result 14194 states and 19413 transitions. [2025-03-08 07:23:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 07:23:52,174 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 07:23:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:52,185 INFO L225 Difference]: With dead ends: 14194 [2025-03-08 07:23:52,185 INFO L226 Difference]: Without dead ends: 12954 [2025-03-08 07:23:52,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2851 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-08 07:23:52,189 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 20266 mSDsluCounter, 9917 mSDsCounter, 0 mSdLazyCounter, 2372 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20266 SdHoareTripleChecker+Valid, 11469 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:52,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20266 Valid, 11469 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2372 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 07:23:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12954 states. [2025-03-08 07:23:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12954 to 12224. [2025-03-08 07:23:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12224 states, 12222 states have (on average 1.3584519718540338) internal successors, (16603), 12223 states have internal predecessors, (16603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 16603 transitions. [2025-03-08 07:23:52,412 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 16603 transitions. Word has length 103 [2025-03-08 07:23:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:52,412 INFO L471 AbstractCegarLoop]: Abstraction has 12224 states and 16603 transitions. [2025-03-08 07:23:52,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 16603 transitions. [2025-03-08 07:23:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:23:52,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:52,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:52,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:23:52,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 07:23:52,615 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:52,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:52,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1152799269, now seen corresponding path program 1 times [2025-03-08 07:23:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:52,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786231894] [2025-03-08 07:23:52,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:52,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:23:52,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:23:52,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:52,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786231894] [2025-03-08 07:23:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786231894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:23:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835454014] [2025-03-08 07:23:52,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:52,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:23:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:23:52,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:23:52,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:23:52,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:23:53,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:23:53,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:53,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:53,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:23:53,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:23:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:53,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:23:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:53,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835454014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:23:53,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:23:53,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-08 07:23:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375316897] [2025-03-08 07:23:53,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:23:53,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 07:23:53,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:53,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 07:23:53,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-08 07:23:53,987 INFO L87 Difference]: Start difference. First operand 12224 states and 16603 transitions. Second operand has 25 states, 25 states have (on average 11.2) internal successors, (280), 24 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:23:55,752 INFO L93 Difference]: Finished difference Result 54272 states and 72493 transitions. [2025-03-08 07:23:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 07:23:55,753 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.2) internal successors, (280), 24 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:23:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:23:55,788 INFO L225 Difference]: With dead ends: 54272 [2025-03-08 07:23:55,788 INFO L226 Difference]: Without dead ends: 44438 [2025-03-08 07:23:55,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=632, Invalid=2448, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 07:23:55,794 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 20874 mSDsluCounter, 5179 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20874 SdHoareTripleChecker+Valid, 6712 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:23:55,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20874 Valid, 6712 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:23:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44438 states. [2025-03-08 07:23:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44438 to 43846. [2025-03-08 07:23:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43846 states, 43844 states have (on average 1.3028008393394763) internal successors, (57120), 43845 states have internal predecessors, (57120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43846 states to 43846 states and 57120 transitions. [2025-03-08 07:23:56,922 INFO L78 Accepts]: Start accepts. Automaton has 43846 states and 57120 transitions. Word has length 104 [2025-03-08 07:23:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:23:56,922 INFO L471 AbstractCegarLoop]: Abstraction has 43846 states and 57120 transitions. [2025-03-08 07:23:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.2) internal successors, (280), 24 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:23:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 43846 states and 57120 transitions. [2025-03-08 07:23:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 07:23:56,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:23:56,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:23:56,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 07:23:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 07:23:57,127 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:23:57,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:23:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1654367365, now seen corresponding path program 1 times [2025-03-08 07:23:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:23:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879137068] [2025-03-08 07:23:57,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:23:57,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 07:23:57,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 07:23:57,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:57,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:23:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879137068] [2025-03-08 07:23:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879137068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:23:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665558252] [2025-03-08 07:23:57,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:23:57,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:23:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:23:57,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:23:57,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:23:57,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 07:23:57,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 07:23:57,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:23:57,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:23:57,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 07:23:57,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:23:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:58,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:23:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:23:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665558252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:23:58,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:23:58,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-03-08 07:23:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362312802] [2025-03-08 07:23:58,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:23:58,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 07:23:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:23:58,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 07:23:58,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-03-08 07:23:58,828 INFO L87 Difference]: Start difference. First operand 43846 states and 57120 transitions. Second operand has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:24:03,623 INFO L93 Difference]: Finished difference Result 212202 states and 274783 transitions. [2025-03-08 07:24:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 07:24:03,624 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-08 07:24:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:24:03,828 INFO L225 Difference]: With dead ends: 212202 [2025-03-08 07:24:03,829 INFO L226 Difference]: Without dead ends: 172074 [2025-03-08 07:24:03,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=714, Invalid=2708, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 07:24:03,877 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 18811 mSDsluCounter, 6828 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18811 SdHoareTripleChecker+Valid, 8377 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:24:03,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18811 Valid, 8377 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:24:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172074 states. [2025-03-08 07:24:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172074 to 170590. [2025-03-08 07:24:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170590 states, 170588 states have (on average 1.2740110676014726) internal successors, (217331), 170589 states have internal predecessors, (217331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170590 states to 170590 states and 217331 transitions. [2025-03-08 07:24:08,639 INFO L78 Accepts]: Start accepts. Automaton has 170590 states and 217331 transitions. Word has length 105 [2025-03-08 07:24:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:24:08,640 INFO L471 AbstractCegarLoop]: Abstraction has 170590 states and 217331 transitions. [2025-03-08 07:24:08,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 170590 states and 217331 transitions. [2025-03-08 07:24:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 07:24:08,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:24:08,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:24:08,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:24:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:24:08,846 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:24:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:24:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1726057952, now seen corresponding path program 1 times [2025-03-08 07:24:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:24:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104663120] [2025-03-08 07:24:08,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:24:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:24:08,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 07:24:08,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 07:24:08,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:24:08,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:24:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:24:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104663120] [2025-03-08 07:24:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104663120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:24:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118762413] [2025-03-08 07:24:09,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:24:09,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:24:09,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:24:09,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:24:09,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:24:09,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 07:24:09,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 07:24:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:24:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:24:09,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:24:09,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:24:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:09,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:24:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118762413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:24:10,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:24:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 07:24:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292288815] [2025-03-08 07:24:10,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:24:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 07:24:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:24:10,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 07:24:10,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-08 07:24:10,399 INFO L87 Difference]: Start difference. First operand 170590 states and 217331 transitions. Second operand has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:24:16,963 INFO L93 Difference]: Finished difference Result 377392 states and 481018 transitions. [2025-03-08 07:24:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 07:24:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 07:24:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:24:17,270 INFO L225 Difference]: With dead ends: 377392 [2025-03-08 07:24:17,270 INFO L226 Difference]: Without dead ends: 211446 [2025-03-08 07:24:17,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 07:24:17,344 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 17445 mSDsluCounter, 8313 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17445 SdHoareTripleChecker+Valid, 9850 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:24:17,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17445 Valid, 9850 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:24:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211446 states. [2025-03-08 07:24:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211446 to 107590. [2025-03-08 07:24:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107590 states, 107588 states have (on average 1.264016433059449) internal successors, (135993), 107589 states have internal predecessors, (135993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107590 states to 107590 states and 135993 transitions. [2025-03-08 07:24:21,454 INFO L78 Accepts]: Start accepts. Automaton has 107590 states and 135993 transitions. Word has length 106 [2025-03-08 07:24:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:24:21,454 INFO L471 AbstractCegarLoop]: Abstraction has 107590 states and 135993 transitions. [2025-03-08 07:24:21,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.538461538461538) internal successors, (300), 25 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 107590 states and 135993 transitions. [2025-03-08 07:24:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 07:24:21,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:24:21,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:24:21,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 07:24:21,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 07:24:21,658 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:24:21,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:24:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2065851855, now seen corresponding path program 1 times [2025-03-08 07:24:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:24:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352361862] [2025-03-08 07:24:21,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:24:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:24:21,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:24:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:24:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:24:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:24:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:22,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:24:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352361862] [2025-03-08 07:24:22,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352361862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:24:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370710428] [2025-03-08 07:24:22,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:24:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:24:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:24:22,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:24:22,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:24:22,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 07:24:22,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 07:24:22,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:24:22,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:24:22,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 07:24:22,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:24:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:22,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:24:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:23,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370710428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:24:23,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:24:23,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-08 07:24:23,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589292401] [2025-03-08 07:24:23,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:24:23,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 07:24:23,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:24:23,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 07:24:23,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-03-08 07:24:23,360 INFO L87 Difference]: Start difference. First operand 107590 states and 135993 transitions. Second operand has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 27 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:24:28,251 INFO L93 Difference]: Finished difference Result 236461 states and 297616 transitions. [2025-03-08 07:24:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-08 07:24:28,251 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 27 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 07:24:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:24:28,413 INFO L225 Difference]: With dead ends: 236461 [2025-03-08 07:24:28,413 INFO L226 Difference]: Without dead ends: 133707 [2025-03-08 07:24:28,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=737, Invalid=3045, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 07:24:28,470 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 15164 mSDsluCounter, 11069 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15164 SdHoareTripleChecker+Valid, 12591 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:24:28,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15164 Valid, 12591 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:24:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133707 states. [2025-03-08 07:24:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133707 to 119397. [2025-03-08 07:24:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119397 states, 119395 states have (on average 1.2601867749905775) internal successors, (150460), 119396 states have internal predecessors, (150460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119397 states to 119397 states and 150460 transitions. [2025-03-08 07:24:32,644 INFO L78 Accepts]: Start accepts. Automaton has 119397 states and 150460 transitions. Word has length 107 [2025-03-08 07:24:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:24:32,645 INFO L471 AbstractCegarLoop]: Abstraction has 119397 states and 150460 transitions. [2025-03-08 07:24:32,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.714285714285714) internal successors, (272), 27 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:24:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 119397 states and 150460 transitions. [2025-03-08 07:24:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 07:24:32,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:24:32,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:24:32,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 07:24:32,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:24:32,848 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:24:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:24:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -477936988, now seen corresponding path program 1 times [2025-03-08 07:24:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:24:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791427172] [2025-03-08 07:24:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:24:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:24:32,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 07:24:32,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 07:24:32,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:24:32,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:24:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:24:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791427172] [2025-03-08 07:24:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791427172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:24:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309118365] [2025-03-08 07:24:33,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:24:33,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:24:33,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:24:33,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:24:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 07:24:33,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 07:24:33,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 07:24:33,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:24:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:24:33,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 07:24:33,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:24:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:24:36,941 INFO L312 TraceCheckSpWp]: Computing backward predicates...