./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a36bffe61006645fe9b7956abb35417c0319419001c91f9dd38ab2cdcd2c159e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:50:25,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:50:25,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:50:25,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:50:25,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:50:25,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:50:25,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:50:25,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:50:25,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:50:25,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:50:25,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:50:25,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:50:25,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:50:25,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:50:25,791 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:50:25,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:50:25,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:50:25,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:50:25,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:50:25,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:50:25,793 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-jdk21/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 -> a36bffe61006645fe9b7956abb35417c0319419001c91f9dd38ab2cdcd2c159e [2025-02-05 17:50:26,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:50:26,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:50:26,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:50:26,074 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:50:26,074 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:50:26,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-02-05 17:50:27,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6a848f04/91680e672e864e74be82e11d46584616/FLAGf93b856a2 [2025-02-05 17:50:27,697 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:50:27,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-02-05 17:50:27,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6a848f04/91680e672e864e74be82e11d46584616/FLAGf93b856a2 [2025-02-05 17:50:27,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6a848f04/91680e672e864e74be82e11d46584616 [2025-02-05 17:50:27,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:50:27,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:50:27,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:50:27,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:50:27,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:50:27,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:50:27" (1/1) ... [2025-02-05 17:50:27,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f4dc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:27, skipping insertion in model container [2025-02-05 17:50:27,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:50:27" (1/1) ... [2025-02-05 17:50:27,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:50:28,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[26925,26938] [2025-02-05 17:50:28,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[33861,33874] [2025-02-05 17:50:28,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:50:28,750 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:50:28,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[26925,26938] [2025-02-05 17:50:28,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c[33861,33874] [2025-02-05 17:50:29,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:50:29,111 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:50:29,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29 WrapperNode [2025-02-05 17:50:29,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:50:29,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:50:29,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:50:29,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:50:29,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,431 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5286 [2025-02-05 17:50:29,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:50:29,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:50:29,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:50:29,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:50:29,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,618 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-02-05 17:50:29,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:50:29,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:50:29,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:50:29,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:50:29,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (1/1) ... [2025-02-05 17:50:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:50:29,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:50:29,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:50:29,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:50:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:50:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:50:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:50:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:50:30,022 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:50:30,024 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:50:33,416 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2377: havoc calculate_output_#t~ret49#1; [2025-02-05 17:50:33,416 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3856: havoc calculate_output2_#t~ret50#1; [2025-02-05 17:50:33,416 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5346: havoc calculate_output3_#t~ret51#1; [2025-02-05 17:50:33,581 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-02-05 17:50:33,581 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:50:33,601 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:50:33,601 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:50:33,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:50:33 BoogieIcfgContainer [2025-02-05 17:50:33,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:50:33,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:50:33,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:50:33,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:50:33,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:50:27" (1/3) ... [2025-02-05 17:50:33,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b38b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:50:33, skipping insertion in model container [2025-02-05 17:50:33,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:50:29" (2/3) ... [2025-02-05 17:50:33,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b38b160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:50:33, skipping insertion in model container [2025-02-05 17:50:33,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:50:33" (3/3) ... [2025-02-05 17:50:33,612 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-02-05 17:50:33,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:50:33,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 948 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:50:33,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:50:33,683 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;@60309d07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:50:33,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:50:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 17:50:33,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:33,694 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] [2025-02-05 17:50:33,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:33,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:33,698 INFO L85 PathProgramCache]: Analyzing trace with hash 56877933, now seen corresponding path program 1 times [2025-02-05 17:50:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:33,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560983379] [2025-02-05 17:50:33,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:33,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 17:50:33,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 17:50:33,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:33,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560983379] [2025-02-05 17:50:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560983379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:33,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:33,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:50:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407279886] [2025-02-05 17:50:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:33,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:50:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:33,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:50:33,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:50:33,933 INFO L87 Difference]: Start difference. First operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:33,990 INFO L93 Difference]: Finished difference Result 1828 states and 3463 transitions. [2025-02-05 17:50:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:50:33,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-05 17:50:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:34,016 INFO L225 Difference]: With dead ends: 1828 [2025-02-05 17:50:34,017 INFO L226 Difference]: Without dead ends: 883 [2025-02-05 17:50:34,021 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-02-05 17:50:34,022 INFO L435 NwaCegarLoop]: 1731 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, 1731 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-02-05 17:50:34,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-02-05 17:50:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-02-05 17:50:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2025-02-05 17:50:34,080 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2025-02-05 17:50:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:34,080 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2025-02-05 17:50:34,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2025-02-05 17:50:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 17:50:34,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:34,081 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] [2025-02-05 17:50:34,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:50:34,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -10128820, now seen corresponding path program 1 times [2025-02-05 17:50:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079370146] [2025-02-05 17:50:34,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:34,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 17:50:34,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 17:50:34,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:34,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:34,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:34,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079370146] [2025-02-05 17:50:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079370146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:34,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:34,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:50:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222935031] [2025-02-05 17:50:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:34,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:50:34,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:34,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:50:34,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:50:34,461 INFO L87 Difference]: Start difference. First operand 883 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:34,626 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2025-02-05 17:50:34,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:50:34,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-05 17:50:34,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:34,632 INFO L225 Difference]: With dead ends: 949 [2025-02-05 17:50:34,635 INFO L226 Difference]: Without dead ends: 883 [2025-02-05 17:50:34,636 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-02-05 17:50:34,637 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:50:34,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:50:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-02-05 17:50:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-02-05 17:50:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2025-02-05 17:50:34,664 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2025-02-05 17:50:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:34,664 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2025-02-05 17:50:34,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2025-02-05 17:50:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:50:34,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:34,665 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] [2025-02-05 17:50:34,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:50:34,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1623297802, now seen corresponding path program 1 times [2025-02-05 17:50:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:34,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818035106] [2025-02-05 17:50:34,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:34,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:50:34,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:50:34,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:34,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:34,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:34,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818035106] [2025-02-05 17:50:34,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818035106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:34,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:34,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942770443] [2025-02-05 17:50:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:34,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:50:34,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:34,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:50:34,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:50:34,892 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:40,153 INFO L93 Difference]: Finished difference Result 3138 states and 5915 transitions. [2025-02-05 17:50:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:50:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-05 17:50:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:40,161 INFO L225 Difference]: With dead ends: 3138 [2025-02-05 17:50:40,162 INFO L226 Difference]: Without dead ends: 2385 [2025-02-05 17:50:40,163 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-02-05 17:50:40,163 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 2515 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:50:40,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 878 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 17:50:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-02-05 17:50:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2025-02-05 17:50:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2383 states have (on average 1.566093159882501) internal successors, (3732), 2384 states have internal predecessors, (3732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3732 transitions. [2025-02-05 17:50:40,206 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3732 transitions. Word has length 60 [2025-02-05 17:50:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:40,206 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3732 transitions. [2025-02-05 17:50:40,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3732 transitions. [2025-02-05 17:50:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:50:40,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:40,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:40,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:50:40,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:40,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash -551956336, now seen corresponding path program 1 times [2025-02-05 17:50:40,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:40,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320585086] [2025-02-05 17:50:40,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:40,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:50:40,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:50:40,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:40,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:40,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320585086] [2025-02-05 17:50:40,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320585086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:40,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:40,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:50:40,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774827832] [2025-02-05 17:50:40,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:40,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:50:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:40,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:50:40,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:50:40,511 INFO L87 Difference]: Start difference. First operand 2385 states and 3732 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:40,914 INFO L93 Difference]: Finished difference Result 3377 states and 5332 transitions. [2025-02-05 17:50:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 17:50:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:50:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:40,928 INFO L225 Difference]: With dead ends: 3377 [2025-02-05 17:50:40,928 INFO L226 Difference]: Without dead ends: 3315 [2025-02-05 17:50:40,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:50:40,931 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 13409 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13409 SdHoareTripleChecker+Valid, 6219 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:50:40,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13409 Valid, 6219 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:50:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2025-02-05 17:50:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2445. [2025-02-05 17:50:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2443 states have (on average 1.5673352435530086) internal successors, (3829), 2444 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3829 transitions. [2025-02-05 17:50:40,983 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3829 transitions. Word has length 90 [2025-02-05 17:50:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3829 transitions. [2025-02-05 17:50:40,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3829 transitions. [2025-02-05 17:50:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:50:40,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:40,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:40,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:50:40,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1028708245, now seen corresponding path program 1 times [2025-02-05 17:50:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339541767] [2025-02-05 17:50:40,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:41,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:50:41,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:50:41,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:41,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:41,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339541767] [2025-02-05 17:50:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339541767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:41,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722064834] [2025-02-05 17:50:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:41,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:41,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:41,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:41,133 INFO L87 Difference]: Start difference. First operand 2445 states and 3829 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-02-05 17:50:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:41,168 INFO L93 Difference]: Finished difference Result 2678 states and 4204 transitions. [2025-02-05 17:50:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:41,168 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-02-05 17:50:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:41,178 INFO L225 Difference]: With dead ends: 2678 [2025-02-05 17:50:41,178 INFO L226 Difference]: Without dead ends: 2556 [2025-02-05 17:50:41,179 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-02-05 17:50:41,181 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 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-02-05 17:50:41,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-02-05 17:50:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2552. [2025-02-05 17:50:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.568235294117647) internal successors, (3999), 2551 states have internal predecessors, (3999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3999 transitions. [2025-02-05 17:50:41,231 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3999 transitions. Word has length 92 [2025-02-05 17:50:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:41,232 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3999 transitions. [2025-02-05 17:50:41,232 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-02-05 17:50:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3999 transitions. [2025-02-05 17:50:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:50:41,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:41,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:41,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:50:41,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash -996385010, now seen corresponding path program 1 times [2025-02-05 17:50:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337254989] [2025-02-05 17:50:41,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:41,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:50:41,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:50:41,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:41,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:41,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337254989] [2025-02-05 17:50:41,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337254989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:41,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:41,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:50:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802105097] [2025-02-05 17:50:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:41,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:50:41,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:41,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:50:41,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:50:41,775 INFO L87 Difference]: Start difference. First operand 2552 states and 3999 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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-02-05 17:50:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:42,198 INFO L93 Difference]: Finished difference Result 2783 states and 4367 transitions. [2025-02-05 17:50:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:50:42,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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-02-05 17:50:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:42,207 INFO L225 Difference]: With dead ends: 2783 [2025-02-05 17:50:42,207 INFO L226 Difference]: Without dead ends: 2554 [2025-02-05 17:50:42,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-02-05 17:50:42,208 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 3102 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3102 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:50:42,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3102 Valid, 2279 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:50:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2025-02-05 17:50:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2025-02-05 17:50:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5674509803921568) internal successors, (3997), 2551 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3997 transitions. [2025-02-05 17:50:42,253 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3997 transitions. Word has length 92 [2025-02-05 17:50:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:42,254 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3997 transitions. [2025-02-05 17:50:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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-02-05 17:50:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3997 transitions. [2025-02-05 17:50:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 17:50:42,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:42,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:42,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:50:42,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash -792626504, now seen corresponding path program 1 times [2025-02-05 17:50:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755864601] [2025-02-05 17:50:42,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:42,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 17:50:42,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 17:50:42,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:42,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:42,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755864601] [2025-02-05 17:50:42,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755864601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:42,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:42,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:50:42,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671177793] [2025-02-05 17:50:42,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:42,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:50:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:42,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:50:42,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:50:42,729 INFO L87 Difference]: Start difference. First operand 2552 states and 3997 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:42,783 INFO L93 Difference]: Finished difference Result 2560 states and 4006 transitions. [2025-02-05 17:50:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:50:42,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 17:50:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:42,792 INFO L225 Difference]: With dead ends: 2560 [2025-02-05 17:50:42,792 INFO L226 Difference]: Without dead ends: 2558 [2025-02-05 17:50:42,793 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-02-05 17:50:42,794 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 9587 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11187 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-02-05 17:50:42,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11187 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-02-05 17:50:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2025-02-05 17:50:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.5657276995305165) internal successors, (4002), 2557 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4002 transitions. [2025-02-05 17:50:42,840 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4002 transitions. Word has length 93 [2025-02-05 17:50:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:42,840 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4002 transitions. [2025-02-05 17:50:42,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4002 transitions. [2025-02-05 17:50:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:50:42,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:42,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:42,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:50:42,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:42,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1237211028, now seen corresponding path program 1 times [2025-02-05 17:50:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269819556] [2025-02-05 17:50:42,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:50:42,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:50:42,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:42,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:42,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269819556] [2025-02-05 17:50:42,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269819556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:42,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:42,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:42,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165908434] [2025-02-05 17:50:42,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:42,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:42,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:42,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:42,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:42,928 INFO L87 Difference]: Start difference. First operand 2558 states and 4002 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:42,956 INFO L93 Difference]: Finished difference Result 3012 states and 4714 transitions. [2025-02-05 17:50:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:50:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:42,965 INFO L225 Difference]: With dead ends: 3012 [2025-02-05 17:50:42,965 INFO L226 Difference]: Without dead ends: 2777 [2025-02-05 17:50:42,967 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-02-05 17:50:42,967 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 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-02-05 17:50:42,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2025-02-05 17:50:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2025-02-05 17:50:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2773 states have (on average 1.56473133790119) internal successors, (4339), 2774 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4339 transitions. [2025-02-05 17:50:43,083 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4339 transitions. Word has length 94 [2025-02-05 17:50:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:43,086 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 4339 transitions. [2025-02-05 17:50:43,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4339 transitions. [2025-02-05 17:50:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:50:43,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:43,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:43,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:50:43,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:43,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash 738196780, now seen corresponding path program 1 times [2025-02-05 17:50:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984815645] [2025-02-05 17:50:43,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:43,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:50:43,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:50:43,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:43,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984815645] [2025-02-05 17:50:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984815645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:43,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:43,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865042794] [2025-02-05 17:50:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:43,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:43,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:43,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:43,172 INFO L87 Difference]: Start difference. First operand 2775 states and 4339 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:43,209 INFO L93 Difference]: Finished difference Result 3647 states and 5697 transitions. [2025-02-05 17:50:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:43,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:50:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:43,220 INFO L225 Difference]: With dead ends: 3647 [2025-02-05 17:50:43,220 INFO L226 Difference]: Without dead ends: 3195 [2025-02-05 17:50:43,222 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-02-05 17:50:43,222 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 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-02-05 17:50:43,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2025-02-05 17:50:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3193. [2025-02-05 17:50:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3191 states have (on average 1.560952679410843) internal successors, (4981), 3192 states have internal predecessors, (4981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4981 transitions. [2025-02-05 17:50:43,282 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4981 transitions. Word has length 94 [2025-02-05 17:50:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:43,283 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4981 transitions. [2025-02-05 17:50:43,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4981 transitions. [2025-02-05 17:50:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:50:43,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:43,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:43,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:50:43,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:43,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 583827948, now seen corresponding path program 1 times [2025-02-05 17:50:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:43,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911990046] [2025-02-05 17:50:43,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:43,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:50:43,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:50:43,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:43,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911990046] [2025-02-05 17:50:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911990046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:43,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:43,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405814421] [2025-02-05 17:50:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:43,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:43,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:43,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:43,361 INFO L87 Difference]: Start difference. First operand 3193 states and 4981 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:43,398 INFO L93 Difference]: Finished difference Result 4869 states and 7567 transitions. [2025-02-05 17:50:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:50:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:43,410 INFO L225 Difference]: With dead ends: 4869 [2025-02-05 17:50:43,411 INFO L226 Difference]: Without dead ends: 3999 [2025-02-05 17:50:43,413 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-02-05 17:50:43,414 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1792 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-02-05 17:50:43,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2025-02-05 17:50:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3997. [2025-02-05 17:50:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3995 states have (on average 1.5521902377972465) internal successors, (6201), 3996 states have internal predecessors, (6201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 6201 transitions. [2025-02-05 17:50:43,488 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 6201 transitions. Word has length 94 [2025-02-05 17:50:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 3997 states and 6201 transitions. [2025-02-05 17:50:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 6201 transitions. [2025-02-05 17:50:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:50:43,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:43,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:43,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:50:43,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:43,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:43,491 INFO L85 PathProgramCache]: Analyzing trace with hash -395102548, now seen corresponding path program 1 times [2025-02-05 17:50:43,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:43,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810861658] [2025-02-05 17:50:43,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:43,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:43,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:50:43,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:50:43,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:43,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:43,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810861658] [2025-02-05 17:50:43,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810861658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:43,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:43,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:43,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897843114] [2025-02-05 17:50:43,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:43,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:43,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:43,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:43,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:43,563 INFO L87 Difference]: Start difference. First operand 3997 states and 6201 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:43,614 INFO L93 Difference]: Finished difference Result 7217 states and 11115 transitions. [2025-02-05 17:50:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:50:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:43,631 INFO L225 Difference]: With dead ends: 7217 [2025-02-05 17:50:43,631 INFO L226 Difference]: Without dead ends: 5543 [2025-02-05 17:50:43,635 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-02-05 17:50:43,636 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1794 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-02-05 17:50:43,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1794 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2025-02-05 17:50:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 5541. [2025-02-05 17:50:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5539 states have (on average 1.5369200216645604) internal successors, (8513), 5540 states have internal predecessors, (8513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 8513 transitions. [2025-02-05 17:50:43,746 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 8513 transitions. Word has length 94 [2025-02-05 17:50:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:43,747 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 8513 transitions. [2025-02-05 17:50:43,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 8513 transitions. [2025-02-05 17:50:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:50:43,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:43,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:43,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:50:43,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:43,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash -843048084, now seen corresponding path program 1 times [2025-02-05 17:50:43,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:43,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637357198] [2025-02-05 17:50:43,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:50:43,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:50:43,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:43,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637357198] [2025-02-05 17:50:43,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637357198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:43,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:43,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257522369] [2025-02-05 17:50:43,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:43,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:43,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:43,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:43,809 INFO L87 Difference]: Start difference. First operand 5541 states and 8513 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:43,889 INFO L93 Difference]: Finished difference Result 11721 states and 17827 transitions. [2025-02-05 17:50:43,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:43,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:50:43,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:43,906 INFO L225 Difference]: With dead ends: 11721 [2025-02-05 17:50:43,906 INFO L226 Difference]: Without dead ends: 8503 [2025-02-05 17:50:43,912 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-02-05 17:50:43,913 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1796 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-02-05 17:50:43,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1796 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2025-02-05 17:50:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8501. [2025-02-05 17:50:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8499 states have (on average 1.5155900694199318) internal successors, (12881), 8500 states have internal predecessors, (12881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 12881 transitions. [2025-02-05 17:50:44,203 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 12881 transitions. Word has length 94 [2025-02-05 17:50:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:44,203 INFO L471 AbstractCegarLoop]: Abstraction has 8501 states and 12881 transitions. [2025-02-05 17:50:44,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 12881 transitions. [2025-02-05 17:50:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:50:44,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:44,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, 1, 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-02-05 17:50:44,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:50:44,205 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:44,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:44,205 INFO L85 PathProgramCache]: Analyzing trace with hash -427872212, now seen corresponding path program 1 times [2025-02-05 17:50:44,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:44,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559917864] [2025-02-05 17:50:44,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:44,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:44,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:50:44,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:50:44,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:44,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:44,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:44,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559917864] [2025-02-05 17:50:44,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559917864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:44,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283798625] [2025-02-05 17:50:44,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:44,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:44,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:44,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:44,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:44,286 INFO L87 Difference]: Start difference. First operand 8501 states and 12881 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:44,449 INFO L93 Difference]: Finished difference Result 20345 states and 30483 transitions. [2025-02-05 17:50:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:44,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:50:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:44,470 INFO L225 Difference]: With dead ends: 20345 [2025-02-05 17:50:44,470 INFO L226 Difference]: Without dead ends: 14167 [2025-02-05 17:50:44,478 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-02-05 17:50:44,479 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1798 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-02-05 17:50:44,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1798 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2025-02-05 17:50:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 14165. [2025-02-05 17:50:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 14163 states have (on average 1.49015039186613) internal successors, (21105), 14164 states have internal predecessors, (21105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 21105 transitions. [2025-02-05 17:50:44,718 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 21105 transitions. Word has length 94 [2025-02-05 17:50:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:44,719 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 21105 transitions. [2025-02-05 17:50:44,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 21105 transitions. [2025-02-05 17:50:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 17:50:44,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:44,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:44,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:50:44,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:44,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -914590484, now seen corresponding path program 1 times [2025-02-05 17:50:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:44,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942055335] [2025-02-05 17:50:44,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:44,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 17:50:44,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 17:50:44,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:44,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942055335] [2025-02-05 17:50:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942055335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458613632] [2025-02-05 17:50:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:44,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:44,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:44,783 INFO L87 Difference]: Start difference. First operand 14165 states and 21105 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:45,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:45,100 INFO L93 Difference]: Finished difference Result 36825 states and 54259 transitions. [2025-02-05 17:50:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:45,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 17:50:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:45,142 INFO L225 Difference]: With dead ends: 36825 [2025-02-05 17:50:45,142 INFO L226 Difference]: Without dead ends: 24983 [2025-02-05 17:50:45,159 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-02-05 17:50:45,159 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1800 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-02-05 17:50:45,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1800 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24983 states. [2025-02-05 17:50:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24983 to 24981. [2025-02-05 17:50:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24981 states, 24979 states have (on average 1.4623884062612595) internal successors, (36529), 24980 states have internal predecessors, (36529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 36529 transitions. [2025-02-05 17:50:45,732 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 36529 transitions. Word has length 94 [2025-02-05 17:50:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:45,734 INFO L471 AbstractCegarLoop]: Abstraction has 24981 states and 36529 transitions. [2025-02-05 17:50:45,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 36529 transitions. [2025-02-05 17:50:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 17:50:45,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:45,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:45,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:50:45,735 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:45,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1402367564, now seen corresponding path program 1 times [2025-02-05 17:50:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692486220] [2025-02-05 17:50:45,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:45,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 17:50:45,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 17:50:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:50:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692486220] [2025-02-05 17:50:45,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692486220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:45,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:45,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:50:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142678332] [2025-02-05 17:50:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:50:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:50:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:50:45,796 INFO L87 Difference]: Start difference. First operand 24981 states and 36529 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:46,095 INFO L93 Difference]: Finished difference Result 48540 states and 71095 transitions. [2025-02-05 17:50:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:50:46,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-05 17:50:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:46,157 INFO L225 Difference]: With dead ends: 48540 [2025-02-05 17:50:46,157 INFO L226 Difference]: Without dead ends: 35993 [2025-02-05 17:50:46,180 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-02-05 17:50:46,181 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 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-02-05 17:50:46,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:50:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35993 states. [2025-02-05 17:50:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35993 to 35991. [2025-02-05 17:50:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35991 states, 35989 states have (on average 1.4525271610769956) internal successors, (52275), 35990 states have internal predecessors, (52275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 52275 transitions. [2025-02-05 17:50:46,922 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 52275 transitions. Word has length 96 [2025-02-05 17:50:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:46,922 INFO L471 AbstractCegarLoop]: Abstraction has 35991 states and 52275 transitions. [2025-02-05 17:50:46,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 52275 transitions. [2025-02-05 17:50:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 17:50:46,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:46,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:46,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:50:46,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:46,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash -272471965, now seen corresponding path program 1 times [2025-02-05 17:50:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19995527] [2025-02-05 17:50:46,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:46,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 17:50:46,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 17:50:46,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:46,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:50:47,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19995527] [2025-02-05 17:50:47,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19995527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:47,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:47,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:50:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428591059] [2025-02-05 17:50:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:50:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:50:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:50:47,303 INFO L87 Difference]: Start difference. First operand 35991 states and 52275 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:50:51,003 INFO L93 Difference]: Finished difference Result 312105 states and 450876 transitions. [2025-02-05 17:50:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:50:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 119 [2025-02-05 17:50:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:50:51,756 INFO L225 Difference]: With dead ends: 312105 [2025-02-05 17:50:51,756 INFO L226 Difference]: Without dead ends: 278439 [2025-02-05 17:50:51,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:50:51,826 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 11665 mSDsluCounter, 3664 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11665 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:50:51,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11665 Valid, 5376 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:50:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278439 states. [2025-02-05 17:50:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278439 to 69655. [2025-02-05 17:50:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69655 states, 69653 states have (on average 1.4433118458644998) internal successors, (100531), 69654 states have internal predecessors, (100531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69655 states to 69655 states and 100531 transitions. [2025-02-05 17:50:54,958 INFO L78 Accepts]: Start accepts. Automaton has 69655 states and 100531 transitions. Word has length 119 [2025-02-05 17:50:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:50:54,960 INFO L471 AbstractCegarLoop]: Abstraction has 69655 states and 100531 transitions. [2025-02-05 17:50:54,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:50:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 69655 states and 100531 transitions. [2025-02-05 17:50:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 17:50:54,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:50:54,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:50:54,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:50:54,969 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:50:54,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:50:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1702935843, now seen corresponding path program 1 times [2025-02-05 17:50:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:50:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599375661] [2025-02-05 17:50:54,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:50:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:50:54,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 17:50:55,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 17:50:55,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:50:55,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:50:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:50:55,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:50:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599375661] [2025-02-05 17:50:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599375661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:50:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:50:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:50:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927071469] [2025-02-05 17:50:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:50:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:50:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:50:55,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:50:55,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:50:55,375 INFO L87 Difference]: Start difference. First operand 69655 states and 100531 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:00,761 INFO L93 Difference]: Finished difference Result 345769 states and 499132 transitions. [2025-02-05 17:51:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:51:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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 119 [2025-02-05 17:51:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:01,265 INFO L225 Difference]: With dead ends: 345769 [2025-02-05 17:51:01,266 INFO L226 Difference]: Without dead ends: 312103 [2025-02-05 17:51:01,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:51:01,342 INFO L435 NwaCegarLoop]: 1709 mSDtfsCounter, 11694 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11694 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:01,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11694 Valid, 5167 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:51:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312103 states. [2025-02-05 17:51:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312103 to 120215. [2025-02-05 17:51:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120215 states, 120213 states have (on average 1.4357432224468236) internal successors, (172595), 120214 states have internal predecessors, (172595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120215 states to 120215 states and 172595 transitions. [2025-02-05 17:51:05,884 INFO L78 Accepts]: Start accepts. Automaton has 120215 states and 172595 transitions. Word has length 119 [2025-02-05 17:51:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:51:05,884 INFO L471 AbstractCegarLoop]: Abstraction has 120215 states and 172595 transitions. [2025-02-05 17:51:05,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:05,885 INFO L276 IsEmpty]: Start isEmpty. Operand 120215 states and 172595 transitions. [2025-02-05 17:51:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 17:51:05,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:51:05,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:51:05,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:51:05,891 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:51:05,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:51:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1548567011, now seen corresponding path program 1 times [2025-02-05 17:51:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:51:05,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567820486] [2025-02-05 17:51:05,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:51:05,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:51:05,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 17:51:05,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 17:51:05,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:51:05,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:51:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:51:06,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:51:06,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567820486] [2025-02-05 17:51:06,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567820486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:51:06,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:51:06,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 17:51:06,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463865914] [2025-02-05 17:51:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:51:06,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 17:51:06,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:51:06,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 17:51:06,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:51:06,102 INFO L87 Difference]: Start difference. First operand 120215 states and 172595 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:51:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:51:12,232 INFO L93 Difference]: Finished difference Result 379433 states and 547388 transitions. [2025-02-05 17:51:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:51:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 119 [2025-02-05 17:51:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:51:12,798 INFO L225 Difference]: With dead ends: 379433 [2025-02-05 17:51:12,798 INFO L226 Difference]: Without dead ends: 345767 [2025-02-05 17:51:12,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:51:12,880 INFO L435 NwaCegarLoop]: 1706 mSDtfsCounter, 11731 mSDsluCounter, 3394 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11731 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:51:12,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11731 Valid, 5100 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:51:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345767 states.