./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.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.6.ufo.BOUNDED-12.pals+Problem12_label00.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 d9bb0fb3fb89b50a98609e7d92154455ef985195351d080b4795952eedc79161 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:44:48,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:44:48,410 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:44:48,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:44:48,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:44:48,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:44:48,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:44:48,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:44:48,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:44:48,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:44:48,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:44:48,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:44:48,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:44:48,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:44:48,452 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:44:48,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:44:48,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:44:48,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:44:48,454 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:44:48,454 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:44:48,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:44:48,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:44:48,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:44:48,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:44:48,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:44:48,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:44:48,455 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:44:48,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:44:48,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:44:48,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:44:48,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:44:48,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:44:48,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:44:48,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:44:48,456 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 -> d9bb0fb3fb89b50a98609e7d92154455ef985195351d080b4795952eedc79161 [2025-02-05 17:44:48,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:44:48,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:44:48,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:44:48,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:44:48,768 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:44:48,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2025-02-05 17:44:50,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1498803de/c76810280b06492f930c720b4c5171d2/FLAG6e8babbc1 [2025-02-05 17:44:50,740 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:44:50,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2025-02-05 17:44:50,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1498803de/c76810280b06492f930c720b4c5171d2/FLAG6e8babbc1 [2025-02-05 17:44:51,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1498803de/c76810280b06492f930c720b4c5171d2 [2025-02-05 17:44:51,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:44:51,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:44:51,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:44:51,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:44:51,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:44:51,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:44:51" (1/1) ... [2025-02-05 17:44:51,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bb446c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:51, skipping insertion in model container [2025-02-05 17:44:51,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:44:51" (1/1) ... [2025-02-05 17:44:51,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:44:51,629 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[15482,15495] [2025-02-05 17:44:51,669 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[17357,17370] [2025-02-05 17:44:52,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:44:52,210 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:44:52,258 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[15482,15495] [2025-02-05 17:44:52,263 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.6.ufo.BOUNDED-12.pals+Problem12_label00.c[17357,17370] [2025-02-05 17:44:52,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:44:52,613 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:44:52,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52 WrapperNode [2025-02-05 17:44:52,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:44:52,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:44:52,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:44:52,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:44:52,623 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:44:52" (1/1) ... [2025-02-05 17:44:52,688 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:44:52" (1/1) ... [2025-02-05 17:44:53,052 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5153 [2025-02-05 17:44:53,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:44:53,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:44:53,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:44:53,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:44:53,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,396 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:44:53,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:44:53,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:44:53,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:44:53,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:44:53,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (1/1) ... [2025-02-05 17:44:53,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:44:53,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:53,672 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:44:53,676 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:44:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:44:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:44:53,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:44:53,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:44:53,808 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:44:53,811 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:44:58,434 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3683: havoc calculate_output2_#t~ret43#1; [2025-02-05 17:44:58,435 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173: havoc calculate_output3_#t~ret44#1; [2025-02-05 17:44:58,436 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2204: havoc calculate_output_#t~ret42#1; [2025-02-05 17:44:58,608 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-02-05 17:44:58,609 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:44:58,657 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:44:58,657 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:44:58,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:44:58 BoogieIcfgContainer [2025-02-05 17:44:58,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:44:58,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:44:58,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:44:58,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:44:58,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:44:51" (1/3) ... [2025-02-05 17:44:58,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bb3d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:44:58, skipping insertion in model container [2025-02-05 17:44:58,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:44:52" (2/3) ... [2025-02-05 17:44:58,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69bb3d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:44:58, skipping insertion in model container [2025-02-05 17:44:58,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:44:58" (3/3) ... [2025-02-05 17:44:58,666 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c [2025-02-05 17:44:58,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:44:58,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label00.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:44:58,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:44:58,780 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;@4a732f14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:44:58,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:44:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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:44:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 17:44:58,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:58,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:58,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:58,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1485248052, now seen corresponding path program 1 times [2025-02-05 17:44:58,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:58,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745638454] [2025-02-05 17:44:58,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:58,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 17:44:58,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 17:44:58,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:58,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:59,101 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:44:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745638454] [2025-02-05 17:44:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745638454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:44:59,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:44:59,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:44:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222100608] [2025-02-05 17:44:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:44:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:44:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:59,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:44:59,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:44:59,132 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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:45:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:02,319 INFO L93 Difference]: Finished difference Result 2535 states and 4877 transitions. [2025-02-05 17:45:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:02,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-02-05 17:45:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:02,339 INFO L225 Difference]: With dead ends: 2535 [2025-02-05 17:45:02,339 INFO L226 Difference]: Without dead ends: 1599 [2025-02-05 17:45:02,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:45:02,346 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 984 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:02,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 648 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 17:45:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-02-05 17:45:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-02-05 17:45:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.646211646837821) internal successors, (2629), 1598 states have internal predecessors, (2629), 0 states have call successors, (0), 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:45:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2629 transitions. [2025-02-05 17:45:02,447 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2629 transitions. Word has length 16 [2025-02-05 17:45:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:02,448 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2629 transitions. [2025-02-05 17:45:02,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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:45:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2629 transitions. [2025-02-05 17:45:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 17:45:02,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:02,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:02,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:45:02,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:02,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1393035855, now seen corresponding path program 1 times [2025-02-05 17:45:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656003365] [2025-02-05 17:45:02,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:02,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 17:45:02,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 17:45:02,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:02,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:02,736 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:45:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:02,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656003365] [2025-02-05 17:45:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656003365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:45:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181868043] [2025-02-05 17:45:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:45:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:02,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:45:02,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:45:02,739 INFO L87 Difference]: Start difference. First operand 1599 states and 2629 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:02,820 INFO L93 Difference]: Finished difference Result 1651 states and 2710 transitions. [2025-02-05 17:45:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:45:02,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 17:45:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:02,827 INFO L225 Difference]: With dead ends: 1651 [2025-02-05 17:45:02,827 INFO L226 Difference]: Without dead ends: 1599 [2025-02-05 17:45:02,828 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:45:02,829 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:02,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-02-05 17:45:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-02-05 17:45:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.6211646837820914) internal successors, (2589), 1598 states have internal predecessors, (2589), 0 states have call successors, (0), 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:45:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2589 transitions. [2025-02-05 17:45:02,878 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2589 transitions. Word has length 26 [2025-02-05 17:45:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:02,878 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2589 transitions. [2025-02-05 17:45:02,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2589 transitions. [2025-02-05 17:45:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:45:02,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:02,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:02,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:45:02,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash 720868248, now seen corresponding path program 1 times [2025-02-05 17:45:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:02,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606240463] [2025-02-05 17:45:02,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:02,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:02,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:45:02,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:45:02,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:02,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:03,153 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:45:03,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:03,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606240463] [2025-02-05 17:45:03,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606240463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:03,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:03,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595063941] [2025-02-05 17:45:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:03,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:03,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:03,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:03,154 INFO L87 Difference]: Start difference. First operand 1599 states and 2589 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:03,498 INFO L93 Difference]: Finished difference Result 2175 states and 3513 transitions. [2025-02-05 17:45:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:45:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 17:45:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:03,512 INFO L225 Difference]: With dead ends: 2175 [2025-02-05 17:45:03,512 INFO L226 Difference]: Without dead ends: 2127 [2025-02-05 17:45:03,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-02-05 17:45:03,516 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9635 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9635 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:03,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9635 Valid, 3990 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:45:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-02-05 17:45:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1645. [2025-02-05 17:45:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.620815581253804) internal successors, (2663), 1644 states have internal predecessors, (2663), 0 states have call successors, (0), 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:45:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2663 transitions. [2025-02-05 17:45:03,562 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2663 transitions. Word has length 65 [2025-02-05 17:45:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:03,563 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2663 transitions. [2025-02-05 17:45:03,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2663 transitions. [2025-02-05 17:45:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:45:03,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:03,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:03,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:45:03,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:03,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1909962381, now seen corresponding path program 1 times [2025-02-05 17:45:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528906695] [2025-02-05 17:45:03,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:03,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:45:03,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:45:03,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:03,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:03,732 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:45:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528906695] [2025-02-05 17:45:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528906695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980632415] [2025-02-05 17:45:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:03,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:03,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:03,734 INFO L87 Difference]: Start difference. First operand 1645 states and 2663 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:03,770 INFO L93 Difference]: Finished difference Result 1822 states and 2946 transitions. [2025-02-05 17:45:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:03,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:45:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:03,778 INFO L225 Difference]: With dead ends: 1822 [2025-02-05 17:45:03,778 INFO L226 Difference]: Without dead ends: 1728 [2025-02-05 17:45:03,779 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:45:03,780 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:03,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-02-05 17:45:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-02-05 17:45:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.618909512761021) internal successors, (2791), 1725 states have internal predecessors, (2791), 0 states have call successors, (0), 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:45:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2791 transitions. [2025-02-05 17:45:03,926 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2791 transitions. Word has length 67 [2025-02-05 17:45:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:03,930 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2791 transitions. [2025-02-05 17:45:03,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2791 transitions. [2025-02-05 17:45:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:45:03,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:03,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:03,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:45:03,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:03,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1877639146, now seen corresponding path program 1 times [2025-02-05 17:45:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16589173] [2025-02-05 17:45:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:03,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:45:04,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:45:04,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:04,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:04,507 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:45:04,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16589173] [2025-02-05 17:45:04,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16589173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:04,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:04,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:04,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016314397] [2025-02-05 17:45:04,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:04,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:04,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:04,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:04,510 INFO L87 Difference]: Start difference. First operand 1726 states and 2791 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:04,766 INFO L93 Difference]: Finished difference Result 1903 states and 3071 transitions. [2025-02-05 17:45:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 17:45:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:04,775 INFO L225 Difference]: With dead ends: 1903 [2025-02-05 17:45:04,775 INFO L226 Difference]: Without dead ends: 1728 [2025-02-05 17:45:04,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 17:45:04,777 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 4516 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:04,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 1922 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:45:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-02-05 17:45:04,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-02-05 17:45:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6177494199535962) internal successors, (2789), 1725 states have internal predecessors, (2789), 0 states have call successors, (0), 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:45:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2789 transitions. [2025-02-05 17:45:04,816 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2789 transitions. Word has length 67 [2025-02-05 17:45:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:04,816 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2789 transitions. [2025-02-05 17:45:04,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2789 transitions. [2025-02-05 17:45:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:45:04,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:04,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:04,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:45:04,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:04,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1953266352, now seen corresponding path program 1 times [2025-02-05 17:45:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:04,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997670756] [2025-02-05 17:45:04,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:04,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:45:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:45:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:05,154 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:45:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997670756] [2025-02-05 17:45:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997670756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:05,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:05,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615968360] [2025-02-05 17:45:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:05,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:05,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:05,156 INFO L87 Difference]: Start difference. First operand 1726 states and 2789 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:05,258 INFO L93 Difference]: Finished difference Result 1734 states and 2798 transitions. [2025-02-05 17:45:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 17:45:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:05,269 INFO L225 Difference]: With dead ends: 1734 [2025-02-05 17:45:05,270 INFO L226 Difference]: Without dead ends: 1732 [2025-02-05 17:45:05,271 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:45:05,272 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 0 mSDsluCounter, 9323 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10879 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:45:05,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10879 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-02-05 17:45:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2025-02-05 17:45:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.615028901734104) internal successors, (2794), 1731 states have internal predecessors, (2794), 0 states have call successors, (0), 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:45:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2794 transitions. [2025-02-05 17:45:05,323 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2794 transitions. Word has length 68 [2025-02-05 17:45:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:05,324 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2794 transitions. [2025-02-05 17:45:05,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2794 transitions. [2025-02-05 17:45:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:45:05,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:05,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:05,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:45:05,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:05,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash -38470604, now seen corresponding path program 1 times [2025-02-05 17:45:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:05,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634126691] [2025-02-05 17:45:05,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:45:05,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:45:05,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:05,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:05,397 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:45:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634126691] [2025-02-05 17:45:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634126691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714881942] [2025-02-05 17:45:05,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:05,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:05,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:05,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:05,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:05,399 INFO L87 Difference]: Start difference. First operand 1732 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:05,433 INFO L93 Difference]: Finished difference Result 1926 states and 3095 transitions. [2025-02-05 17:45:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:05,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:45:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:05,441 INFO L225 Difference]: With dead ends: 1926 [2025-02-05 17:45:05,441 INFO L226 Difference]: Without dead ends: 1826 [2025-02-05 17:45:05,442 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:45:05,443 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1702 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:45:05,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-02-05 17:45:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2025-02-05 17:45:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 1.610867178924259) internal successors, (2935), 1823 states have internal predecessors, (2935), 0 states have call successors, (0), 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:45:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2935 transitions. [2025-02-05 17:45:05,484 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2935 transitions. Word has length 69 [2025-02-05 17:45:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:05,484 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2935 transitions. [2025-02-05 17:45:05,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2935 transitions. [2025-02-05 17:45:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:45:05,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:05,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:05,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:45:05,487 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:05,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash -192839436, now seen corresponding path program 1 times [2025-02-05 17:45:05,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:05,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595629706] [2025-02-05 17:45:05,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:05,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:45:05,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:45:05,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:05,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:05,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:45:05,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:05,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595629706] [2025-02-05 17:45:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595629706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664623274] [2025-02-05 17:45:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:05,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:05,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:05,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:05,565 INFO L87 Difference]: Start difference. First operand 1824 states and 2935 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:05,603 INFO L93 Difference]: Finished difference Result 2342 states and 3735 transitions. [2025-02-05 17:45:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:45:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:05,612 INFO L225 Difference]: With dead ends: 2342 [2025-02-05 17:45:05,612 INFO L226 Difference]: Without dead ends: 2071 [2025-02-05 17:45:05,613 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:45:05,614 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:05,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-02-05 17:45:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2069. [2025-02-05 17:45:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2067 states have (on average 1.5999032414126755) internal successors, (3307), 2068 states have internal predecessors, (3307), 0 states have call successors, (0), 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:45:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3307 transitions. [2025-02-05 17:45:05,666 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3307 transitions. Word has length 69 [2025-02-05 17:45:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:05,667 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3307 transitions. [2025-02-05 17:45:05,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3307 transitions. [2025-02-05 17:45:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:45:05,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:05,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:45:05,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:05,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1171769932, now seen corresponding path program 1 times [2025-02-05 17:45:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544809570] [2025-02-05 17:45:05,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:05,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:45:05,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:45:05,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:05,729 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:45:05,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544809570] [2025-02-05 17:45:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544809570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078227054] [2025-02-05 17:45:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:05,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:05,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:05,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:05,732 INFO L87 Difference]: Start difference. First operand 2069 states and 3307 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:05,771 INFO L93 Difference]: Finished difference Result 3053 states and 4809 transitions. [2025-02-05 17:45:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:45:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:05,782 INFO L225 Difference]: With dead ends: 3053 [2025-02-05 17:45:05,782 INFO L226 Difference]: Without dead ends: 2537 [2025-02-05 17:45:05,784 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:45:05,785 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 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:45:05,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:05,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-02-05 17:45:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-02-05 17:45:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2533 states have (on average 1.5803395183576787) internal successors, (4003), 2534 states have internal predecessors, (4003), 0 states have call successors, (0), 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:45:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 4003 transitions. [2025-02-05 17:45:05,844 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 4003 transitions. Word has length 69 [2025-02-05 17:45:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:05,845 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 4003 transitions. [2025-02-05 17:45:05,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 4003 transitions. [2025-02-05 17:45:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:45:05,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:05,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:05,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:45:05,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:05,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:05,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1619715468, now seen corresponding path program 1 times [2025-02-05 17:45:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:05,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091041369] [2025-02-05 17:45:05,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:05,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:45:05,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:45:05,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:05,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:05,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091041369] [2025-02-05 17:45:05,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091041369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:05,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283673142] [2025-02-05 17:45:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:05,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:05,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:05,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:05,913 INFO L87 Difference]: Start difference. First operand 2535 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:05,971 INFO L93 Difference]: Finished difference Result 4403 states and 6813 transitions. [2025-02-05 17:45:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:05,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:45:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:05,985 INFO L225 Difference]: With dead ends: 4403 [2025-02-05 17:45:05,985 INFO L226 Difference]: Without dead ends: 3421 [2025-02-05 17:45:05,988 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:45:05,989 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 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:45:05,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-02-05 17:45:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3419. [2025-02-05 17:45:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.5507755340942346) internal successors, (5299), 3418 states have internal predecessors, (5299), 0 states have call successors, (0), 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:45:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5299 transitions. [2025-02-05 17:45:06,138 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5299 transitions. Word has length 69 [2025-02-05 17:45:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:06,138 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5299 transitions. [2025-02-05 17:45:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5299 transitions. [2025-02-05 17:45:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:45:06,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:06,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:06,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:45:06,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1204539596, now seen corresponding path program 1 times [2025-02-05 17:45:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660375222] [2025-02-05 17:45:06,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:06,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:45:06,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:45:06,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:06,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:06,207 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:45:06,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660375222] [2025-02-05 17:45:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660375222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:06,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338899291] [2025-02-05 17:45:06,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:06,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:06,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:06,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:06,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:06,209 INFO L87 Difference]: Start difference. First operand 3419 states and 5299 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:06,304 INFO L93 Difference]: Finished difference Result 6959 states and 10533 transitions. [2025-02-05 17:45:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:06,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:45:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:06,326 INFO L225 Difference]: With dead ends: 6959 [2025-02-05 17:45:06,327 INFO L226 Difference]: Without dead ends: 5093 [2025-02-05 17:45:06,331 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:45:06,332 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 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:45:06,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2025-02-05 17:45:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 5091. [2025-02-05 17:45:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 5089 states have (on average 1.5128708980153271) internal successors, (7699), 5090 states have internal predecessors, (7699), 0 states have call successors, (0), 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:45:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 7699 transitions. [2025-02-05 17:45:06,507 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 7699 transitions. Word has length 69 [2025-02-05 17:45:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:06,507 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 7699 transitions. [2025-02-05 17:45:06,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 7699 transitions. [2025-02-05 17:45:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 17:45:06,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:06,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:06,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:45:06,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1691257868, now seen corresponding path program 1 times [2025-02-05 17:45:06,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378521485] [2025-02-05 17:45:06,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:06,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 17:45:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 17:45:06,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:06,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:06,584 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:45:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378521485] [2025-02-05 17:45:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378521485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007980937] [2025-02-05 17:45:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:06,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:06,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:06,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:06,586 INFO L87 Difference]: Start difference. First operand 5091 states and 7699 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:06,716 INFO L93 Difference]: Finished difference Result 11783 states and 17397 transitions. [2025-02-05 17:45:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 17:45:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:06,750 INFO L225 Difference]: With dead ends: 11783 [2025-02-05 17:45:06,751 INFO L226 Difference]: Without dead ends: 8245 [2025-02-05 17:45:06,759 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:45:06,759 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1716 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:45:06,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1716 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2025-02-05 17:45:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 8243. [2025-02-05 17:45:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8243 states, 8241 states have (on average 1.4700885814828297) internal successors, (12115), 8242 states have internal predecessors, (12115), 0 states have call successors, (0), 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:45:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 12115 transitions. [2025-02-05 17:45:07,098 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 12115 transitions. Word has length 69 [2025-02-05 17:45:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:07,098 INFO L471 AbstractCegarLoop]: Abstraction has 8243 states and 12115 transitions. [2025-02-05 17:45:07,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 12115 transitions. [2025-02-05 17:45:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 17:45:07,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:07,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:07,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:45:07,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:07,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1488078392, now seen corresponding path program 1 times [2025-02-05 17:45:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490717471] [2025-02-05 17:45:07,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:07,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:45:07,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:45:07,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:07,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:07,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490717471] [2025-02-05 17:45:07,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490717471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:07,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:07,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130139476] [2025-02-05 17:45:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:07,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:07,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:07,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:07,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:07,209 INFO L87 Difference]: Start difference. First operand 8243 states and 12115 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:10,343 INFO L93 Difference]: Finished difference Result 11249 states and 17042 transitions. [2025-02-05 17:45:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:10,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-05 17:45:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:10,369 INFO L225 Difference]: With dead ends: 11249 [2025-02-05 17:45:10,369 INFO L226 Difference]: Without dead ends: 9745 [2025-02-05 17:45:10,375 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:45:10,376 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 753 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:10,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1403 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 17:45:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9745 states. [2025-02-05 17:45:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9745 to 9745. [2025-02-05 17:45:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9745 states, 9743 states have (on average 1.4647439187108693) internal successors, (14271), 9744 states have internal predecessors, (14271), 0 states have call successors, (0), 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:45:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9745 states to 9745 states and 14271 transitions. [2025-02-05 17:45:10,620 INFO L78 Accepts]: Start accepts. Automaton has 9745 states and 14271 transitions. Word has length 87 [2025-02-05 17:45:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:10,621 INFO L471 AbstractCegarLoop]: Abstraction has 9745 states and 14271 transitions. [2025-02-05 17:45:10,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 9745 states and 14271 transitions. [2025-02-05 17:45:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:45:10,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:10,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:10,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:45:10,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:10,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash 704030, now seen corresponding path program 1 times [2025-02-05 17:45:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:10,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484331941] [2025-02-05 17:45:10,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:10,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:45:10,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:45:10,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:10,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:45:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:10,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484331941] [2025-02-05 17:45:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484331941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:10,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:10,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159113812] [2025-02-05 17:45:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:10,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:10,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:10,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:10,878 INFO L87 Difference]: Start difference. First operand 9745 states and 14271 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:11,780 INFO L93 Difference]: Finished difference Result 49343 states and 71046 transitions. [2025-02-05 17:45:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:11,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:45:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:11,945 INFO L225 Difference]: With dead ends: 49343 [2025-02-05 17:45:11,945 INFO L226 Difference]: Without dead ends: 44605 [2025-02-05 17:45:11,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:45:11,962 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8022 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8022 SdHoareTripleChecker+Valid, 4153 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:11,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8022 Valid, 4153 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:45:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44605 states. [2025-02-05 17:45:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44605 to 15473. [2025-02-05 17:45:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15473 states, 15471 states have (on average 1.4478055717148213) internal successors, (22399), 15472 states have internal predecessors, (22399), 0 states have call successors, (0), 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:45:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15473 states to 15473 states and 22399 transitions. [2025-02-05 17:45:12,543 INFO L78 Accepts]: Start accepts. Automaton has 15473 states and 22399 transitions. Word has length 90 [2025-02-05 17:45:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:12,543 INFO L471 AbstractCegarLoop]: Abstraction has 15473 states and 22399 transitions. [2025-02-05 17:45:12,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 15473 states and 22399 transitions. [2025-02-05 17:45:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:45:12,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:12,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:12,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:45:12,551 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:12,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash -153664802, now seen corresponding path program 1 times [2025-02-05 17:45:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:12,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039913761] [2025-02-05 17:45:12,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:12,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:45:12,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:45:12,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:45:12,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039913761] [2025-02-05 17:45:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039913761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:12,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037638838] [2025-02-05 17:45:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:12,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:12,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:12,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:12,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:12,828 INFO L87 Difference]: Start difference. First operand 15473 states and 22399 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:13,933 INFO L93 Difference]: Finished difference Result 56031 states and 80582 transitions. [2025-02-05 17:45:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:13,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:45:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:14,047 INFO L225 Difference]: With dead ends: 56031 [2025-02-05 17:45:14,049 INFO L226 Difference]: Without dead ends: 49341 [2025-02-05 17:45:14,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:45:14,071 INFO L435 NwaCegarLoop]: 1637 mSDtfsCounter, 8022 mSDsluCounter, 2504 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8022 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:14,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8022 Valid, 4141 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:45:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49341 states. [2025-02-05 17:45:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49341 to 24529. [2025-02-05 17:45:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24529 states, 24527 states have (on average 1.4364170098259061) internal successors, (35231), 24528 states have internal predecessors, (35231), 0 states have call successors, (0), 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:45:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24529 states to 24529 states and 35231 transitions. [2025-02-05 17:45:14,784 INFO L78 Accepts]: Start accepts. Automaton has 24529 states and 35231 transitions. Word has length 90 [2025-02-05 17:45:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:14,784 INFO L471 AbstractCegarLoop]: Abstraction has 24529 states and 35231 transitions. [2025-02-05 17:45:14,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 24529 states and 35231 transitions. [2025-02-05 17:45:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:45:14,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:14,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:14,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:45:14,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1132595298, now seen corresponding path program 1 times [2025-02-05 17:45:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239901115] [2025-02-05 17:45:14,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:14,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:45:14,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:45:14,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:14,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:45:15,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239901115] [2025-02-05 17:45:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239901115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:15,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:15,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987678892] [2025-02-05 17:45:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:15,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:15,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:15,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:15,052 INFO L87 Difference]: Start difference. First operand 24529 states and 35231 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:16,095 INFO L93 Difference]: Finished difference Result 62719 states and 90086 transitions. [2025-02-05 17:45:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:16,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:45:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:16,186 INFO L225 Difference]: With dead ends: 62719 [2025-02-05 17:45:16,186 INFO L226 Difference]: Without dead ends: 56029 [2025-02-05 17:45:16,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:45:16,209 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8044 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8044 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:16,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8044 Valid, 4090 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:45:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56029 states. [2025-02-05 17:45:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56029 to 31217. [2025-02-05 17:45:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31217 states, 31215 states have (on average 1.4331251001121257) internal successors, (44735), 31216 states have internal predecessors, (44735), 0 states have call successors, (0), 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:45:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31217 states to 31217 states and 44735 transitions. [2025-02-05 17:45:17,408 INFO L78 Accepts]: Start accepts. Automaton has 31217 states and 44735 transitions. Word has length 90 [2025-02-05 17:45:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:17,408 INFO L471 AbstractCegarLoop]: Abstraction has 31217 states and 44735 transitions. [2025-02-05 17:45:17,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31217 states and 44735 transitions. [2025-02-05 17:45:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:45:17,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:17,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:17,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:45:17,414 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:17,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1580540834, now seen corresponding path program 1 times [2025-02-05 17:45:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770789916] [2025-02-05 17:45:17,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:17,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:45:17,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:45:17,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:17,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:45:17,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770789916] [2025-02-05 17:45:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770789916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604525497] [2025-02-05 17:45:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:17,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:17,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:17,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:17,691 INFO L87 Difference]: Start difference. First operand 31217 states and 44735 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:18,925 INFO L93 Difference]: Finished difference Result 69407 states and 99590 transitions. [2025-02-05 17:45:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:45:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:19,043 INFO L225 Difference]: With dead ends: 69407 [2025-02-05 17:45:19,047 INFO L226 Difference]: Without dead ends: 62717 [2025-02-05 17:45:19,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:45:19,081 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8084 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8084 SdHoareTripleChecker+Valid, 4034 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:19,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8084 Valid, 4034 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:45:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62717 states. [2025-02-05 17:45:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62717 to 37905. [2025-02-05 17:45:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37905 states, 37903 states have (on average 1.4309949080547715) internal successors, (54239), 37904 states have internal predecessors, (54239), 0 states have call successors, (0), 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:45:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37905 states to 37905 states and 54239 transitions. [2025-02-05 17:45:20,183 INFO L78 Accepts]: Start accepts. Automaton has 37905 states and 54239 transitions. Word has length 90 [2025-02-05 17:45:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:20,184 INFO L471 AbstractCegarLoop]: Abstraction has 37905 states and 54239 transitions. [2025-02-05 17:45:20,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 37905 states and 54239 transitions. [2025-02-05 17:45:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:45:20,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:20,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:20,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:45:20,300 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:20,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1165364962, now seen corresponding path program 1 times [2025-02-05 17:45:20,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644519789] [2025-02-05 17:45:20,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:20,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:20,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:45:20,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:45:20,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:20,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:45:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:20,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644519789] [2025-02-05 17:45:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644519789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:20,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:20,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131445042] [2025-02-05 17:45:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:20,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:20,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:20,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:20,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:20,485 INFO L87 Difference]: Start difference. First operand 37905 states and 54239 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:22,195 INFO L93 Difference]: Finished difference Result 76095 states and 109094 transitions. [2025-02-05 17:45:22,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:22,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:45:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:22,274 INFO L225 Difference]: With dead ends: 76095 [2025-02-05 17:45:22,275 INFO L226 Difference]: Without dead ends: 69405 [2025-02-05 17:45:22,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:45:22,290 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8129 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8129 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:22,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8129 Valid, 4063 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:45:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69405 states. [2025-02-05 17:45:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69405 to 44593. [2025-02-05 17:45:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44593 states, 44591 states have (on average 1.4295037115112914) internal successors, (63743), 44592 states have internal predecessors, (63743), 0 states have call successors, (0), 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:45:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44593 states to 44593 states and 63743 transitions. [2025-02-05 17:45:23,586 INFO L78 Accepts]: Start accepts. Automaton has 44593 states and 63743 transitions. Word has length 90 [2025-02-05 17:45:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 44593 states and 63743 transitions. [2025-02-05 17:45:23,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 44593 states and 63743 transitions. [2025-02-05 17:45:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:45:23,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:23,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:23,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:45:23,600 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:23,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:23,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1652083234, now seen corresponding path program 1 times [2025-02-05 17:45:23,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:23,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859855409] [2025-02-05 17:45:23,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:23,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:23,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:45:23,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:45:23,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:23,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 17:45:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:23,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859855409] [2025-02-05 17:45:23,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859855409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:23,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:23,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:45:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459729884] [2025-02-05 17:45:23,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:23,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:45:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:23,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:45:23,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:45:23,847 INFO L87 Difference]: Start difference. First operand 44593 states and 63743 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:25,616 INFO L93 Difference]: Finished difference Result 82783 states and 118598 transitions. [2025-02-05 17:45:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:45:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 17:45:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:25,765 INFO L225 Difference]: With dead ends: 82783 [2025-02-05 17:45:25,765 INFO L226 Difference]: Without dead ends: 76093 [2025-02-05 17:45:25,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:45:25,795 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8046 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8046 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:25,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8046 Valid, 4142 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:45:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76093 states. [2025-02-05 17:45:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76093 to 51281. [2025-02-05 17:45:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51281 states, 51279 states have (on average 1.4284014898886483) internal successors, (73247), 51280 states have internal predecessors, (73247), 0 states have call successors, (0), 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:45:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51281 states to 51281 states and 73247 transitions. [2025-02-05 17:45:27,167 INFO L78 Accepts]: Start accepts. Automaton has 51281 states and 73247 transitions. Word has length 90 [2025-02-05 17:45:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:27,167 INFO L471 AbstractCegarLoop]: Abstraction has 51281 states and 73247 transitions. [2025-02-05 17:45:27,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 51281 states and 73247 transitions. [2025-02-05 17:45:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:45:27,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:27,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:27,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:45:27,171 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:27,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1774366180, now seen corresponding path program 1 times [2025-02-05 17:45:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:27,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386650967] [2025-02-05 17:45:27,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:27,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:45:27,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:45:27,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:27,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:27,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:27,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386650967] [2025-02-05 17:45:27,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386650967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:27,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:27,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:45:27,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622681245] [2025-02-05 17:45:27,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:27,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:27,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:27,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:27,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:27,411 INFO L87 Difference]: Start difference. First operand 51281 states and 73247 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 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:45:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:31,013 INFO L93 Difference]: Finished difference Result 57291 states and 82486 transitions. [2025-02-05 17:45:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 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:45:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:31,075 INFO L225 Difference]: With dead ends: 57291 [2025-02-05 17:45:31,075 INFO L226 Difference]: Without dead ends: 54285 [2025-02-05 17:45:31,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:45:31,087 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 897 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:31,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 570 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 17:45:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54285 states. [2025-02-05 17:45:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54285 to 54285. [2025-02-05 17:45:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54285 states, 54283 states have (on average 1.4162076524878875) internal successors, (76876), 54284 states have internal predecessors, (76876), 0 states have call successors, (0), 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:45:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54285 states to 54285 states and 76876 transitions. [2025-02-05 17:45:32,216 INFO L78 Accepts]: Start accepts. Automaton has 54285 states and 76876 transitions. Word has length 90 [2025-02-05 17:45:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:32,216 INFO L471 AbstractCegarLoop]: Abstraction has 54285 states and 76876 transitions. [2025-02-05 17:45:32,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 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:45:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 54285 states and 76876 transitions. [2025-02-05 17:45:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:45:32,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:32,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:32,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:45:32,220 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:32,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash 112504176, now seen corresponding path program 1 times [2025-02-05 17:45:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909744597] [2025-02-05 17:45:32,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:32,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:45:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:45:32,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:32,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:32,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:32,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909744597] [2025-02-05 17:45:32,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909744597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:32,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:32,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383403502] [2025-02-05 17:45:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:32,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:32,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:32,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:32,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:32,329 INFO L87 Difference]: Start difference. First operand 54285 states and 76876 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:33,865 INFO L93 Difference]: Finished difference Result 102513 states and 145454 transitions. [2025-02-05 17:45:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:33,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 17:45:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:33,922 INFO L225 Difference]: With dead ends: 102513 [2025-02-05 17:45:33,923 INFO L226 Difference]: Without dead ends: 54287 [2025-02-05 17:45:33,940 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:45:33,941 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:33,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54287 states. [2025-02-05 17:45:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54287 to 54285. [2025-02-05 17:45:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54285 states, 54283 states have (on average 1.403533334561465) internal successors, (76188), 54284 states have internal predecessors, (76188), 0 states have call successors, (0), 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:45:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54285 states to 54285 states and 76188 transitions. [2025-02-05 17:45:35,052 INFO L78 Accepts]: Start accepts. Automaton has 54285 states and 76188 transitions. Word has length 91 [2025-02-05 17:45:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:35,053 INFO L471 AbstractCegarLoop]: Abstraction has 54285 states and 76188 transitions. [2025-02-05 17:45:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 54285 states and 76188 transitions. [2025-02-05 17:45:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 17:45:35,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:35,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:35,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:45:35,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:35,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash -490310180, now seen corresponding path program 1 times [2025-02-05 17:45:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:35,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265044048] [2025-02-05 17:45:35,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:35,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 17:45:35,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 17:45:35,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:35,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265044048] [2025-02-05 17:45:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265044048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:35,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045467481] [2025-02-05 17:45:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:35,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:35,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:35,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:35,149 INFO L87 Difference]: Start difference. First operand 54285 states and 76188 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:45:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:35,591 INFO L93 Difference]: Finished difference Result 72070 states and 101412 transitions. [2025-02-05 17:45:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:35,592 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:45:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:35,620 INFO L225 Difference]: With dead ends: 72070 [2025-02-05 17:45:35,620 INFO L226 Difference]: Without dead ends: 23844 [2025-02-05 17:45:35,652 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:45:35,654 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:35,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2025-02-05 17:45:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 23836. [2025-02-05 17:45:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23836 states, 23834 states have (on average 1.3961147939917764) internal successors, (33275), 23835 states have internal predecessors, (33275), 0 states have call successors, (0), 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:45:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23836 states to 23836 states and 33275 transitions. [2025-02-05 17:45:36,595 INFO L78 Accepts]: Start accepts. Automaton has 23836 states and 33275 transitions. Word has length 92 [2025-02-05 17:45:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:36,595 INFO L471 AbstractCegarLoop]: Abstraction has 23836 states and 33275 transitions. [2025-02-05 17:45:36,596 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:45:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 23836 states and 33275 transitions. [2025-02-05 17:45:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 17:45:36,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:36,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:36,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:45:36,598 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -818182665, now seen corresponding path program 1 times [2025-02-05 17:45:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725260439] [2025-02-05 17:45:36,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:36,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 17:45:36,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 17:45:36,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:36,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:36,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:36,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725260439] [2025-02-05 17:45:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725260439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:36,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643164657] [2025-02-05 17:45:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:36,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:36,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:36,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:36,777 INFO L87 Difference]: Start difference. First operand 23836 states and 33275 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:37,010 INFO L93 Difference]: Finished difference Result 32720 states and 45757 transitions. [2025-02-05 17:45:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:37,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 17:45:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:37,033 INFO L225 Difference]: With dead ends: 32720 [2025-02-05 17:45:37,033 INFO L226 Difference]: Without dead ends: 14958 [2025-02-05 17:45:37,050 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:45:37,052 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:37,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14958 states. [2025-02-05 17:45:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14958 to 14956. [2025-02-05 17:45:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14956 states, 14954 states have (on average 1.3825732245553028) internal successors, (20675), 14955 states have internal predecessors, (20675), 0 states have call successors, (0), 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:45:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14956 states to 14956 states and 20675 transitions. [2025-02-05 17:45:37,397 INFO L78 Accepts]: Start accepts. Automaton has 14956 states and 20675 transitions. Word has length 93 [2025-02-05 17:45:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:37,398 INFO L471 AbstractCegarLoop]: Abstraction has 14956 states and 20675 transitions. [2025-02-05 17:45:37,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 14956 states and 20675 transitions. [2025-02-05 17:45:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 17:45:37,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:37,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:37,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:45:37,400 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -85389410, now seen corresponding path program 1 times [2025-02-05 17:45:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268367079] [2025-02-05 17:45:37,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:37,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 17:45:37,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 17:45:37,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:37,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268367079] [2025-02-05 17:45:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268367079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:37,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:37,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56961550] [2025-02-05 17:45:37,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:37,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:37,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:37,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:37,485 INFO L87 Difference]: Start difference. First operand 14956 states and 20675 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:37,597 INFO L93 Difference]: Finished difference Result 19400 states and 26857 transitions. [2025-02-05 17:45:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 17:45:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:37,609 INFO L225 Difference]: With dead ends: 19400 [2025-02-05 17:45:37,609 INFO L226 Difference]: Without dead ends: 10518 [2025-02-05 17:45:37,614 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:45:37,615 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:37,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10518 states. [2025-02-05 17:45:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10518 to 10516. [2025-02-05 17:45:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10516 states, 10514 states have (on average 1.372931329655697) internal successors, (14435), 10515 states have internal predecessors, (14435), 0 states have call successors, (0), 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:45:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10516 states to 10516 states and 14435 transitions. [2025-02-05 17:45:37,847 INFO L78 Accepts]: Start accepts. Automaton has 10516 states and 14435 transitions. Word has length 95 [2025-02-05 17:45:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:37,847 INFO L471 AbstractCegarLoop]: Abstraction has 10516 states and 14435 transitions. [2025-02-05 17:45:37,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10516 states and 14435 transitions. [2025-02-05 17:45:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 17:45:37,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:37,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:37,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 17:45:37,848 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:37,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1915372955, now seen corresponding path program 1 times [2025-02-05 17:45:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918770197] [2025-02-05 17:45:37,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:37,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 17:45:37,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 17:45:37,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:37,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:37,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:37,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918770197] [2025-02-05 17:45:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918770197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:37,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:37,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:37,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478433203] [2025-02-05 17:45:37,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:37,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:37,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:37,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:37,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:37,929 INFO L87 Difference]: Start difference. First operand 10516 states and 14435 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:37,999 INFO L93 Difference]: Finished difference Result 12740 states and 17497 transitions. [2025-02-05 17:45:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 17:45:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:38,010 INFO L225 Difference]: With dead ends: 12740 [2025-02-05 17:45:38,010 INFO L226 Difference]: Without dead ends: 8298 [2025-02-05 17:45:38,016 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:45:38,016 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:38,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2025-02-05 17:45:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 8296. [2025-02-05 17:45:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8296 states, 8294 states have (on average 1.367856281649385) internal successors, (11345), 8295 states have internal predecessors, (11345), 0 states have call successors, (0), 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:45:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 11345 transitions. [2025-02-05 17:45:38,134 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 11345 transitions. Word has length 97 [2025-02-05 17:45:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:38,134 INFO L471 AbstractCegarLoop]: Abstraction has 8296 states and 11345 transitions. [2025-02-05 17:45:38,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 11345 transitions. [2025-02-05 17:45:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 17:45:38,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:38,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:38,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 17:45:38,136 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:38,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1098571103, now seen corresponding path program 1 times [2025-02-05 17:45:38,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132206150] [2025-02-05 17:45:38,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:38,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 17:45:38,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 17:45:38,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:38,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132206150] [2025-02-05 17:45:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132206150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:38,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552683492] [2025-02-05 17:45:38,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:45:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:38,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:45:38,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:45:38,276 INFO L87 Difference]: Start difference. First operand 8296 states and 11345 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:40,837 INFO L93 Difference]: Finished difference Result 15057 states and 20465 transitions. [2025-02-05 17:45:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:45:40,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 17:45:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:40,851 INFO L225 Difference]: With dead ends: 15057 [2025-02-05 17:45:40,851 INFO L226 Difference]: Without dead ends: 9047 [2025-02-05 17:45:40,856 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:45:40,856 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1007 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:40,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1415 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 17:45:40,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9047 states. [2025-02-05 17:45:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9047 to 9047. [2025-02-05 17:45:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9047 states, 9045 states have (on average 1.337976782752902) internal successors, (12102), 9046 states have internal predecessors, (12102), 0 states have call successors, (0), 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:45:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 12102 transitions. [2025-02-05 17:45:41,051 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 12102 transitions. Word has length 97 [2025-02-05 17:45:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 9047 states and 12102 transitions. [2025-02-05 17:45:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 12102 transitions. [2025-02-05 17:45:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 17:45:41,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:41,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:41,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 17:45:41,054 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:41,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1704200628, now seen corresponding path program 1 times [2025-02-05 17:45:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548522675] [2025-02-05 17:45:41,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:41,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:41,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 17:45:41,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 17:45:41,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:41,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:41,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548522675] [2025-02-05 17:45:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548522675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:45:41,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:45:41,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:45:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898046060] [2025-02-05 17:45:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:45:41,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:45:41,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:41,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:45:41,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:45:41,176 INFO L87 Difference]: Start difference. First operand 9047 states and 12102 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:41,270 INFO L93 Difference]: Finished difference Result 10161 states and 13619 transitions. [2025-02-05 17:45:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:45:41,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 17:45:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:41,284 INFO L225 Difference]: With dead ends: 10161 [2025-02-05 17:45:41,284 INFO L226 Difference]: Without dead ends: 7939 [2025-02-05 17:45:41,289 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:45:41,289 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:41,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:45:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7939 states. [2025-02-05 17:45:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7939 to 7937. [2025-02-05 17:45:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7937 states, 7935 states have (on average 1.3323251417769377) internal successors, (10572), 7936 states have internal predecessors, (10572), 0 states have call successors, (0), 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:45:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 10572 transitions. [2025-02-05 17:45:41,409 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 10572 transitions. Word has length 99 [2025-02-05 17:45:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:41,409 INFO L471 AbstractCegarLoop]: Abstraction has 7937 states and 10572 transitions. [2025-02-05 17:45:41,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:45:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 10572 transitions. [2025-02-05 17:45:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 17:45:41,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:41,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 17:45:41,411 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:41,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -932695213, now seen corresponding path program 1 times [2025-02-05 17:45:41,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:41,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343492848] [2025-02-05 17:45:41,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:41,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:45:41,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:45:41,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:41,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:41,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343492848] [2025-02-05 17:45:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343492848] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:45:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846083994] [2025-02-05 17:45:41,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:45:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:45:41,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:45:41,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:45:41,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 17:45:41,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 17:45:41,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:41,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:41,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 17:45:41,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:45:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:42,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:45:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846083994] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:45:42,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:45:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-02-05 17:45:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789413171] [2025-02-05 17:45:42,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:45:42,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:45:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:42,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:45:42,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:45:42,823 INFO L87 Difference]: Start difference. First operand 7937 states and 10572 transitions. Second operand has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 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:45:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:45,104 INFO L93 Difference]: Finished difference Result 15643 states and 20739 transitions. [2025-02-05 17:45:45,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 17:45:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-02-05 17:45:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:45,122 INFO L225 Difference]: With dead ends: 15643 [2025-02-05 17:45:45,123 INFO L226 Difference]: Without dead ends: 14441 [2025-02-05 17:45:45,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=781, Invalid=3251, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 17:45:45,129 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 13960 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13960 SdHoareTripleChecker+Valid, 9784 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:45,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13960 Valid, 9784 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:45:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14441 states. [2025-02-05 17:45:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14441 to 13749. [2025-02-05 17:45:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13749 states, 13747 states have (on average 1.3179602822433985) internal successors, (18118), 13748 states have internal predecessors, (18118), 0 states have call successors, (0), 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:45:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13749 states to 13749 states and 18118 transitions. [2025-02-05 17:45:45,503 INFO L78 Accepts]: Start accepts. Automaton has 13749 states and 18118 transitions. Word has length 101 [2025-02-05 17:45:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:45,503 INFO L471 AbstractCegarLoop]: Abstraction has 13749 states and 18118 transitions. [2025-02-05 17:45:45,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 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:45:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 13749 states and 18118 transitions. [2025-02-05 17:45:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 17:45:45,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:45,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:45,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:45:45,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 17:45:45,705 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:45,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1284037986, now seen corresponding path program 1 times [2025-02-05 17:45:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:45,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249707113] [2025-02-05 17:45:45,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:45,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 17:45:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 17:45:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:46,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:46,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249707113] [2025-02-05 17:45:46,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249707113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:45:46,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111606010] [2025-02-05 17:45:46,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:46,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:45:46,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:45:46,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:45:46,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:45:46,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 17:45:46,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 17:45:46,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:46,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:46,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 17:45:46,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:45:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:47,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:45:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111606010] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:45:48,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:45:48,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 32 [2025-02-05 17:45:48,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075550397] [2025-02-05 17:45:48,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:45:48,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 17:45:48,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 17:45:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:45:48,311 INFO L87 Difference]: Start difference. First operand 13749 states and 18118 transitions. Second operand has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 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:45:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:45:50,935 INFO L93 Difference]: Finished difference Result 42101 states and 55290 transitions. [2025-02-05 17:45:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 17:45:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 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 102 [2025-02-05 17:45:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:45:50,983 INFO L225 Difference]: With dead ends: 42101 [2025-02-05 17:45:50,984 INFO L226 Difference]: Without dead ends: 35234 [2025-02-05 17:45:51,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1014, Invalid=4242, Unknown=0, NotChecked=0, Total=5256 [2025-02-05 17:45:51,003 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 24516 mSDsluCounter, 8018 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24516 SdHoareTripleChecker+Valid, 9527 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:45:51,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24516 Valid, 9527 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:45:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35234 states. [2025-02-05 17:45:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35234 to 34894. [2025-02-05 17:45:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34894 states, 34892 states have (on average 1.2880316404906569) internal successors, (44942), 34893 states have internal predecessors, (44942), 0 states have call successors, (0), 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:45:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34894 states to 34894 states and 44942 transitions. [2025-02-05 17:45:51,928 INFO L78 Accepts]: Start accepts. Automaton has 34894 states and 44942 transitions. Word has length 102 [2025-02-05 17:45:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:45:51,929 INFO L471 AbstractCegarLoop]: Abstraction has 34894 states and 44942 transitions. [2025-02-05 17:45:51,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 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:45:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34894 states and 44942 transitions. [2025-02-05 17:45:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 17:45:51,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:45:51,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:45:51,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:45:52,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 17:45:52,131 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:45:52,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:45:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1836367294, now seen corresponding path program 1 times [2025-02-05 17:45:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:45:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008585800] [2025-02-05 17:45:52,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:45:52,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 17:45:52,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 17:45:52,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:52,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:52,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:45:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008585800] [2025-02-05 17:45:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008585800] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:45:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133755502] [2025-02-05 17:45:52,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:45:52,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:45:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:45:52,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:45:52,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:45:52,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 17:45:53,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 17:45:53,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:45:53,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:45:53,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 17:45:53,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:45:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:53,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:45:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:45:54,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133755502] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:45:54,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:45:54,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-02-05 17:45:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244449254] [2025-02-05 17:45:54,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:45:54,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 17:45:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:45:54,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 17:45:54,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-02-05 17:45:54,009 INFO L87 Difference]: Start difference. First operand 34894 states and 44942 transitions. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 27 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)