./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be75db290ec34096274e1fab73d19995a5f186f7a3d66814837a196a3b4a7979 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:49:37,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:49:37,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:49:37,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:49:37,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:49:37,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:49:37,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:49:37,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:49:37,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:49:37,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:49:37,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:49:37,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:49:37,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:49:37,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:49:37,753 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:49:37,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:49:37,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:49:37,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:49:37,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:49:37,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:49:37,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:49:37,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:49:37,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:49:37,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:49:37,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:49:37,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:49:37,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:49:37,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:49:37,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:49:37,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:49:37,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:49:37,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:49:37,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:49:37,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:49:37,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:49:37,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:49:37,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:49:37,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:49:37,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:49:37,757 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 -> be75db290ec34096274e1fab73d19995a5f186f7a3d66814837a196a3b4a7979 [2025-01-09 05:49:37,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:49:38,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:49:38,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:49:38,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:49:38,007 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:49:38,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:49:39,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b0a8604/e030affd176b418982e46bd87cc297aa/FLAG4f60e5fe0 [2025-01-09 05:49:39,539 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:49:39,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:49:39,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b0a8604/e030affd176b418982e46bd87cc297aa/FLAG4f60e5fe0 [2025-01-09 05:49:39,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63b0a8604/e030affd176b418982e46bd87cc297aa [2025-01-09 05:49:39,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:49:39,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:49:39,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:49:39,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:49:39,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:49:39,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:49:39" (1/1) ... [2025-01-09 05:49:39,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127b5adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:39, skipping insertion in model container [2025-01-09 05:49:39,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:49:39" (1/1) ... [2025-01-09 05:49:39,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:49:40,049 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[11705,11718] [2025-01-09 05:49:40,106 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[18641,18654] [2025-01-09 05:49:40,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:49:40,517 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:49:40,542 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[11705,11718] [2025-01-09 05:49:40,547 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.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c[18641,18654] [2025-01-09 05:49:40,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:49:40,803 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:49:40,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40 WrapperNode [2025-01-09 05:49:40,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:49:40,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:49:40,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:49:40,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:49:40,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:40,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,143 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5092 [2025-01-09 05:49:41,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:49:41,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:49:41,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:49:41,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:49:41,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,315 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-01-09 05:49:41,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:49:41,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:49:41,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:49:41,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:49:41,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (1/1) ... [2025-01-09 05:49:41,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:49:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:41,617 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-01-09 05:49:41,620 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-01-09 05:49:41,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:49:41,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:49:41,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:49:41,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:49:41,711 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:49:41,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:49:45,220 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-01-09 05:49:45,221 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:49:45,244 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:49:45,245 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:49:45,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:49:45 BoogieIcfgContainer [2025-01-09 05:49:45,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:49:45,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:49:45,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:49:45,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:49:45,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:49:39" (1/3) ... [2025-01-09 05:49:45,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245f7054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:49:45, skipping insertion in model container [2025-01-09 05:49:45,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:49:40" (2/3) ... [2025-01-09 05:49:45,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245f7054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:49:45, skipping insertion in model container [2025-01-09 05:49:45,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:49:45" (3/3) ... [2025-01-09 05:49:45,252 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:49:45,262 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:49:45,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 900 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:49:45,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:49:45,324 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;@724bcf51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:49:45,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:49:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 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-01-09 05:49:45,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:49:45,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:45,335 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] [2025-01-09 05:49:45,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 147233052, now seen corresponding path program 1 times [2025-01-09 05:49:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:45,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537833425] [2025-01-09 05:49:45,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:45,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:45,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:49:45,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:49:45,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:45,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537833425] [2025-01-09 05:49:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537833425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:45,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:45,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:49:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462419009] [2025-01-09 05:49:45,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:45,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:49:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:45,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:49:45,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:49:45,536 INFO L87 Difference]: Start difference. First operand has 900 states, 897 states have (on average 1.9030100334448161) internal successors, (1707), 899 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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-01-09 05:49:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:45,580 INFO L93 Difference]: Finished difference Result 1762 states and 3343 transitions. [2025-01-09 05:49:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:49:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-09 05:49:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:45,591 INFO L225 Difference]: With dead ends: 1762 [2025-01-09 05:49:45,591 INFO L226 Difference]: Without dead ends: 835 [2025-01-09 05:49:45,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:49:45,602 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:45,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-01-09 05:49:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-01-09 05:49:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.893157262905162) internal successors, (1577), 834 states have internal predecessors, (1577), 0 states have call successors, (0), 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-01-09 05:49:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1577 transitions. [2025-01-09 05:49:45,690 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1577 transitions. Word has length 24 [2025-01-09 05:49:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:45,690 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1577 transitions. [2025-01-09 05:49:45,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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-01-09 05:49:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1577 transitions. [2025-01-09 05:49:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 05:49:45,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:45,691 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] [2025-01-09 05:49:45,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:49:45,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:45,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1846911654, now seen corresponding path program 1 times [2025-01-09 05:49:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:45,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027373279] [2025-01-09 05:49:45,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:45,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 05:49:45,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 05:49:45,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:45,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027373279] [2025-01-09 05:49:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027373279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:45,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:49:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796526246] [2025-01-09 05:49:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:49:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:45,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:49:45,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:49:45,898 INFO L87 Difference]: Start difference. First operand 835 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-01-09 05:49:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:45,982 INFO L93 Difference]: Finished difference Result 883 states and 1651 transitions. [2025-01-09 05:49:45,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:49:45,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-09 05:49:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:45,987 INFO L225 Difference]: With dead ends: 883 [2025-01-09 05:49:45,987 INFO L226 Difference]: Without dead ends: 835 [2025-01-09 05:49:45,987 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-01-09 05:49:45,988 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 0 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6264 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:45,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6264 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-01-09 05:49:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-01-09 05:49:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 833 states have (on average 1.8559423769507803) internal successors, (1546), 834 states have internal predecessors, (1546), 0 states have call successors, (0), 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-01-09 05:49:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1546 transitions. [2025-01-09 05:49:46,004 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1546 transitions. Word has length 24 [2025-01-09 05:49:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:46,004 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1546 transitions. [2025-01-09 05:49:46,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-01-09 05:49:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1546 transitions. [2025-01-09 05:49:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:49:46,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:46,006 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] [2025-01-09 05:49:46,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:49:46,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:46,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash 427928945, now seen corresponding path program 1 times [2025-01-09 05:49:46,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:46,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797720357] [2025-01-09 05:49:46,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:46,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:46,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:49:46,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:49:46,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:46,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:46,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797720357] [2025-01-09 05:49:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797720357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:46,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:49:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710503326] [2025-01-09 05:49:46,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:46,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:49:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:46,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:49:46,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:49:46,183 INFO L87 Difference]: Start difference. First operand 835 states and 1546 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-09 05:49:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:46,385 INFO L93 Difference]: Finished difference Result 1275 states and 2246 transitions. [2025-01-09 05:49:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:49:46,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-01-09 05:49:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:46,391 INFO L225 Difference]: With dead ends: 1275 [2025-01-09 05:49:46,391 INFO L226 Difference]: Without dead ends: 1231 [2025-01-09 05:49:46,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-09 05:49:46,393 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 7979 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7979 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:46,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7979 Valid, 2696 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:49:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-01-09 05:49:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 877. [2025-01-09 05:49:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8434285714285714) internal successors, (1613), 876 states have internal predecessors, (1613), 0 states have call successors, (0), 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-01-09 05:49:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1613 transitions. [2025-01-09 05:49:46,414 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1613 transitions. Word has length 54 [2025-01-09 05:49:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:46,415 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1613 transitions. [2025-01-09 05:49:46,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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-01-09 05:49:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1613 transitions. [2025-01-09 05:49:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:49:46,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:46,416 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] [2025-01-09 05:49:46,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:49:46,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:46,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1802126305, now seen corresponding path program 1 times [2025-01-09 05:49:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24763389] [2025-01-09 05:49:46,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:46,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:49:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:49:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:46,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:46,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-01-09 05:49:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24763389] [2025-01-09 05:49:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24763389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23066319] [2025-01-09 05:49:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:46,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:46,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:46,508 INFO L87 Difference]: Start difference. First operand 877 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-01-09 05:49:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:46,538 INFO L93 Difference]: Finished difference Result 1038 states and 1868 transitions. [2025-01-09 05:49:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:46,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 05:49:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:46,542 INFO L225 Difference]: With dead ends: 1038 [2025-01-09 05:49:46,542 INFO L226 Difference]: Without dead ends: 952 [2025-01-09 05:49:46,543 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-01-09 05:49:46,544 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1484 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:46,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1605 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-01-09 05:49:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2025-01-09 05:49:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8213530655391121) internal successors, (1723), 947 states have internal predecessors, (1723), 0 states have call successors, (0), 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-01-09 05:49:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1723 transitions. [2025-01-09 05:49:46,564 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1723 transitions. Word has length 56 [2025-01-09 05:49:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1723 transitions. [2025-01-09 05:49:46,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-01-09 05:49:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1723 transitions. [2025-01-09 05:49:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:49:46,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:46,569 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] [2025-01-09 05:49:46,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:49:46,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:46,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:46,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1868619817, now seen corresponding path program 1 times [2025-01-09 05:49:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:46,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194665086] [2025-01-09 05:49:46,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:46,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:46,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:49:46,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:49:46,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:46,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:46,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194665086] [2025-01-09 05:49:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194665086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:46,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:49:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684017951] [2025-01-09 05:49:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:46,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:49:46,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:46,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:49:46,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:49:46,799 INFO L87 Difference]: Start difference. First operand 948 states and 1723 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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-01-09 05:49:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:46,952 INFO L93 Difference]: Finished difference Result 1107 states and 1971 transitions. [2025-01-09 05:49:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:49:46,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 05:49:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:46,956 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 05:49:46,956 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 05:49:46,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:49:46,957 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 5976 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5976 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:46,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5976 Valid, 1804 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 05:49:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 948. [2025-01-09 05:49:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8192389006342495) internal successors, (1721), 947 states have internal predecessors, (1721), 0 states have call successors, (0), 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-01-09 05:49:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1721 transitions. [2025-01-09 05:49:46,977 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1721 transitions. Word has length 56 [2025-01-09 05:49:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:46,977 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1721 transitions. [2025-01-09 05:49:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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-01-09 05:49:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1721 transitions. [2025-01-09 05:49:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 05:49:46,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:46,979 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] [2025-01-09 05:49:46,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:49:46,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:46,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1677916402, now seen corresponding path program 1 times [2025-01-09 05:49:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:46,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569641846] [2025-01-09 05:49:46,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:46,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 05:49:47,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 05:49:47,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:47,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:47,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:47,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569641846] [2025-01-09 05:49:47,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569641846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:47,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:47,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:49:47,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057794606] [2025-01-09 05:49:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:47,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:49:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:47,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:49:47,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:49:47,237 INFO L87 Difference]: Start difference. First operand 948 states and 1721 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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-01-09 05:49:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:47,295 INFO L93 Difference]: Finished difference Result 956 states and 1730 transitions. [2025-01-09 05:49:47,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:49:47,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-01-09 05:49:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:47,299 INFO L225 Difference]: With dead ends: 956 [2025-01-09 05:49:47,299 INFO L226 Difference]: Without dead ends: 954 [2025-01-09 05:49:47,299 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-01-09 05:49:47,300 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 0 mSDsluCounter, 9227 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10767 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-01-09 05:49:47,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10767 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-01-09 05:49:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2025-01-09 05:49:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 952 states have (on average 1.8130252100840336) internal successors, (1726), 953 states have internal predecessors, (1726), 0 states have call successors, (0), 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-01-09 05:49:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1726 transitions. [2025-01-09 05:49:47,317 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1726 transitions. Word has length 57 [2025-01-09 05:49:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:47,317 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1726 transitions. [2025-01-09 05:49:47,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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-01-09 05:49:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1726 transitions. [2025-01-09 05:49:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:49:47,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:47,318 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] [2025-01-09 05:49:47,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:49:47,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:47,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1113103913, now seen corresponding path program 1 times [2025-01-09 05:49:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:47,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765985768] [2025-01-09 05:49:47,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:47,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:49:47,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:49:47,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:47,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:47,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:47,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765985768] [2025-01-09 05:49:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765985768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:47,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:47,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970237412] [2025-01-09 05:49:47,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:47,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:47,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:47,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:47,368 INFO L87 Difference]: Start difference. First operand 954 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:47,388 INFO L93 Difference]: Finished difference Result 1264 states and 2198 transitions. [2025-01-09 05:49:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:47,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-01-09 05:49:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:47,393 INFO L225 Difference]: With dead ends: 1264 [2025-01-09 05:49:47,393 INFO L226 Difference]: Without dead ends: 1101 [2025-01-09 05:49:47,393 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-01-09 05:49:47,394 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1497 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1668 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-01-09 05:49:47,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1668 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-01-09 05:49:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1099. [2025-01-09 05:49:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 1097 states have (on average 1.7711941659070192) internal successors, (1943), 1098 states have internal predecessors, (1943), 0 states have call successors, (0), 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-01-09 05:49:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1943 transitions. [2025-01-09 05:49:47,413 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1943 transitions. Word has length 58 [2025-01-09 05:49:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:47,413 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1943 transitions. [2025-01-09 05:49:47,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1943 transitions. [2025-01-09 05:49:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:49:47,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:47,414 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] [2025-01-09 05:49:47,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:49:47,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:47,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1943601367, now seen corresponding path program 1 times [2025-01-09 05:49:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536767463] [2025-01-09 05:49:47,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:47,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:49:47,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:49:47,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:47,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536767463] [2025-01-09 05:49:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536767463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012655152] [2025-01-09 05:49:47,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:47,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:47,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:47,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:47,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:47,477 INFO L87 Difference]: Start difference. First operand 1099 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:47,499 INFO L93 Difference]: Finished difference Result 1683 states and 2821 transitions. [2025-01-09 05:49:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-01-09 05:49:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:47,504 INFO L225 Difference]: With dead ends: 1683 [2025-01-09 05:49:47,504 INFO L226 Difference]: Without dead ends: 1375 [2025-01-09 05:49:47,505 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-01-09 05:49:47,505 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1495 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1670 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-01-09 05:49:47,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1670 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-01-09 05:49:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1373. [2025-01-09 05:49:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1371 states have (on average 1.7104303428154632) internal successors, (2345), 1372 states have internal predecessors, (2345), 0 states have call successors, (0), 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-01-09 05:49:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2345 transitions. [2025-01-09 05:49:47,531 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2345 transitions. Word has length 58 [2025-01-09 05:49:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:47,531 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2345 transitions. [2025-01-09 05:49:47,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2345 transitions. [2025-01-09 05:49:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:49:47,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:47,532 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] [2025-01-09 05:49:47,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:49:47,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:47,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash 135897129, now seen corresponding path program 1 times [2025-01-09 05:49:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:47,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215768532] [2025-01-09 05:49:47,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:47,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:49:47,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:49:47,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:47,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215768532] [2025-01-09 05:49:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215768532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:47,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961582275] [2025-01-09 05:49:47,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:47,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:47,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:47,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:47,577 INFO L87 Difference]: Start difference. First operand 1373 states and 2345 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:47,605 INFO L93 Difference]: Finished difference Result 2473 states and 3971 transitions. [2025-01-09 05:49:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:47,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-01-09 05:49:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:47,613 INFO L225 Difference]: With dead ends: 2473 [2025-01-09 05:49:47,613 INFO L226 Difference]: Without dead ends: 1891 [2025-01-09 05:49:47,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-01-09 05:49:47,615 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 1493 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1672 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-01-09 05:49:47,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1672 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-01-09 05:49:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1889. [2025-01-09 05:49:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1887 states have (on average 1.634870164281929) internal successors, (3085), 1888 states have internal predecessors, (3085), 0 states have call successors, (0), 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-01-09 05:49:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 3085 transitions. [2025-01-09 05:49:47,655 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 3085 transitions. Word has length 58 [2025-01-09 05:49:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:47,655 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 3085 transitions. [2025-01-09 05:49:47,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 3085 transitions. [2025-01-09 05:49:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 05:49:47,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:47,656 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] [2025-01-09 05:49:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:49:47,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:47,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1916829993, now seen corresponding path program 1 times [2025-01-09 05:49:47,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:47,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707584172] [2025-01-09 05:49:47,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:47,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 05:49:47,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 05:49:47,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:47,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:47,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707584172] [2025-01-09 05:49:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707584172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664230673] [2025-01-09 05:49:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:47,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:47,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:47,702 INFO L87 Difference]: Start difference. First operand 1889 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:47,743 INFO L93 Difference]: Finished difference Result 3957 states and 6079 transitions. [2025-01-09 05:49:47,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:47,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-01-09 05:49:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:47,752 INFO L225 Difference]: With dead ends: 3957 [2025-01-09 05:49:47,752 INFO L226 Difference]: Without dead ends: 2859 [2025-01-09 05:49:47,754 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-01-09 05:49:47,755 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 1491 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1674 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-01-09 05:49:47,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1674 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2025-01-09 05:49:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2025-01-09 05:49:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2855 states have (on average 1.5541155866900176) internal successors, (4437), 2856 states have internal predecessors, (4437), 0 states have call successors, (0), 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-01-09 05:49:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4437 transitions. [2025-01-09 05:49:47,814 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4437 transitions. Word has length 58 [2025-01-09 05:49:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:47,814 INFO L471 AbstractCegarLoop]: Abstraction has 2857 states and 4437 transitions. [2025-01-09 05:49:47,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-01-09 05:49:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4437 transitions. [2025-01-09 05:49:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:49:47,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:47,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:49:47,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:49:47,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:47,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -275603324, now seen corresponding path program 1 times [2025-01-09 05:49:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991308681] [2025-01-09 05:49:47,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:47,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:49:47,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:49:47,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:47,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991308681] [2025-01-09 05:49:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991308681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:47,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:47,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:47,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293243125] [2025-01-09 05:49:47,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:47,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:47,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:47,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:47,856 INFO L87 Difference]: Start difference. First operand 2857 states and 4437 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:47,975 INFO L93 Difference]: Finished difference Result 5040 states and 7611 transitions. [2025-01-09 05:49:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 05:49:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:48,000 INFO L225 Difference]: With dead ends: 5040 [2025-01-09 05:49:48,000 INFO L226 Difference]: Without dead ends: 3853 [2025-01-09 05:49:48,007 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-01-09 05:49:48,008 INFO L435 NwaCegarLoop]: 1598 mSDtfsCounter, 1496 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1669 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-01-09 05:49:48,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-01-09 05:49:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2025-01-09 05:49:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.5149389451805664) internal successors, (5831), 3850 states have internal predecessors, (5831), 0 states have call successors, (0), 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-01-09 05:49:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5831 transitions. [2025-01-09 05:49:48,127 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5831 transitions. Word has length 60 [2025-01-09 05:49:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5831 transitions. [2025-01-09 05:49:48,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5831 transitions. [2025-01-09 05:49:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:49:48,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:48,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:49:48,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:49:48,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash -792988928, now seen corresponding path program 1 times [2025-01-09 05:49:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690308720] [2025-01-09 05:49:48,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:48,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:49:48,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:49:48,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:48,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:48,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:48,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690308720] [2025-01-09 05:49:48,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690308720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:48,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:48,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:49:48,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169776839] [2025-01-09 05:49:48,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:48,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:48,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:48,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:48,211 INFO L87 Difference]: Start difference. First operand 3851 states and 5831 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:50,972 INFO L93 Difference]: Finished difference Result 5355 states and 8704 transitions. [2025-01-09 05:49:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:50,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 05:49:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:50,984 INFO L225 Difference]: With dead ends: 5355 [2025-01-09 05:49:50,984 INFO L226 Difference]: Without dead ends: 4602 [2025-01-09 05:49:50,985 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-01-09 05:49:50,986 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:50,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 582 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 05:49:50,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2025-01-09 05:49:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602. [2025-01-09 05:49:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 4600 states have (on average 1.4804347826086957) internal successors, (6810), 4601 states have internal predecessors, (6810), 0 states have call successors, (0), 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-01-09 05:49:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6810 transitions. [2025-01-09 05:49:51,058 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6810 transitions. Word has length 60 [2025-01-09 05:49:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:51,058 INFO L471 AbstractCegarLoop]: Abstraction has 4602 states and 6810 transitions. [2025-01-09 05:49:51,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6810 transitions. [2025-01-09 05:49:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:49:51,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:51,060 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] [2025-01-09 05:49:51,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:49:51,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -925514908, now seen corresponding path program 1 times [2025-01-09 05:49:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284387977] [2025-01-09 05:49:51,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:51,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:49:51,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:49:51,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:51,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:49:51,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:51,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284387977] [2025-01-09 05:49:51,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284387977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:51,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:51,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:49:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140019620] [2025-01-09 05:49:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:51,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:49:51,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:51,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:49:51,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:49:51,238 INFO L87 Difference]: Start difference. First operand 4602 states and 6810 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-01-09 05:49:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:51,513 INFO L93 Difference]: Finished difference Result 20550 states and 29472 transitions. [2025-01-09 05:49:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:49:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 77 [2025-01-09 05:49:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:51,558 INFO L225 Difference]: With dead ends: 20550 [2025-01-09 05:49:51,559 INFO L226 Difference]: Without dead ends: 17492 [2025-01-09 05:49:51,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:49:51,569 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 6329 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6329 SdHoareTripleChecker+Valid, 3658 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:51,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6329 Valid, 3658 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:49:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17492 states. [2025-01-09 05:49:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17492 to 7658. [2025-01-09 05:49:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7658 states, 7656 states have (on average 1.4516718913270636) internal successors, (11114), 7657 states have internal predecessors, (11114), 0 states have call successors, (0), 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-01-09 05:49:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 11114 transitions. [2025-01-09 05:49:51,780 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 11114 transitions. Word has length 77 [2025-01-09 05:49:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 7658 states and 11114 transitions. [2025-01-09 05:49:51,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-01-09 05:49:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 11114 transitions. [2025-01-09 05:49:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:49:51,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:51,782 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] [2025-01-09 05:49:51,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:49:51,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 312747108, now seen corresponding path program 1 times [2025-01-09 05:49:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963480842] [2025-01-09 05:49:51,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:51,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:49:51,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:49:51,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:51,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:49:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963480842] [2025-01-09 05:49:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963480842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:49:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590503707] [2025-01-09 05:49:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:52,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:49:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:52,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:49:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:49:52,074 INFO L87 Difference]: Start difference. First operand 7658 states and 11114 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-01-09 05:49:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:52,356 INFO L93 Difference]: Finished difference Result 23606 states and 33776 transitions. [2025-01-09 05:49:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:49:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 77 [2025-01-09 05:49:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:52,398 INFO L225 Difference]: With dead ends: 23606 [2025-01-09 05:49:52,399 INFO L226 Difference]: Without dead ends: 20548 [2025-01-09 05:49:52,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:49:52,411 INFO L435 NwaCegarLoop]: 1609 mSDtfsCounter, 6354 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:52,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 3586 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:49:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2025-01-09 05:49:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 12250. [2025-01-09 05:49:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12250 states, 12248 states have (on average 1.4312540822991509) internal successors, (17530), 12249 states have internal predecessors, (17530), 0 states have call successors, (0), 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-01-09 05:49:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12250 states to 12250 states and 17530 transitions. [2025-01-09 05:49:52,699 INFO L78 Accepts]: Start accepts. Automaton has 12250 states and 17530 transitions. Word has length 77 [2025-01-09 05:49:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:52,699 INFO L471 AbstractCegarLoop]: Abstraction has 12250 states and 17530 transitions. [2025-01-09 05:49:52,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-01-09 05:49:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 12250 states and 17530 transitions. [2025-01-09 05:49:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:49:52,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:52,701 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] [2025-01-09 05:49:52,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:49:52,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:52,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1902721692, now seen corresponding path program 1 times [2025-01-09 05:49:52,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:52,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135310171] [2025-01-09 05:49:52,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:52,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:49:52,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:49:52,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:52,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:49:52,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135310171] [2025-01-09 05:49:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135310171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:52,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:52,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:49:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660113536] [2025-01-09 05:49:52,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:52,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:49:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:52,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:49:52,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:49:52,839 INFO L87 Difference]: Start difference. First operand 12250 states and 17530 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-01-09 05:49:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:53,138 INFO L93 Difference]: Finished difference Result 26662 states and 38080 transitions. [2025-01-09 05:49:53,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:49:53,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 77 [2025-01-09 05:49:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:53,174 INFO L225 Difference]: With dead ends: 26662 [2025-01-09 05:49:53,174 INFO L226 Difference]: Without dead ends: 23604 [2025-01-09 05:49:53,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:49:53,183 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6401 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6401 SdHoareTripleChecker+Valid, 3558 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:53,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6401 Valid, 3558 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:49:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23604 states. [2025-01-09 05:49:53,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23604 to 15306. [2025-01-09 05:49:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15306 states, 15304 states have (on average 1.4266858337689492) internal successors, (21834), 15305 states have internal predecessors, (21834), 0 states have call successors, (0), 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-01-09 05:49:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15306 states to 15306 states and 21834 transitions. [2025-01-09 05:49:53,613 INFO L78 Accepts]: Start accepts. Automaton has 15306 states and 21834 transitions. Word has length 77 [2025-01-09 05:49:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:53,613 INFO L471 AbstractCegarLoop]: Abstraction has 15306 states and 21834 transitions. [2025-01-09 05:49:53,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-01-09 05:49:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 15306 states and 21834 transitions. [2025-01-09 05:49:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:49:53,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:53,615 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] [2025-01-09 05:49:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:49:53,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:53,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -121788828, now seen corresponding path program 1 times [2025-01-09 05:49:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69580622] [2025-01-09 05:49:53,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:53,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:49:53,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:49:53,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:53,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:49:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69580622] [2025-01-09 05:49:53,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69580622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:53,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:53,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:49:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944651473] [2025-01-09 05:49:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:53,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:49:53,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:53,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:49:53,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:49:53,774 INFO L87 Difference]: Start difference. First operand 15306 states and 21834 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-01-09 05:49:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:54,149 INFO L93 Difference]: Finished difference Result 29718 states and 42384 transitions. [2025-01-09 05:49:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:49:54,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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 77 [2025-01-09 05:49:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:54,178 INFO L225 Difference]: With dead ends: 29718 [2025-01-09 05:49:54,178 INFO L226 Difference]: Without dead ends: 26660 [2025-01-09 05:49:54,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:49:54,187 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 6347 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6347 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:54,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6347 Valid, 3621 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:49:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26660 states. [2025-01-09 05:49:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26660 to 18362. [2025-01-09 05:49:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18362 states, 18360 states have (on average 1.4236383442265794) internal successors, (26138), 18361 states have internal predecessors, (26138), 0 states have call successors, (0), 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-01-09 05:49:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18362 states to 18362 states and 26138 transitions. [2025-01-09 05:49:54,649 INFO L78 Accepts]: Start accepts. Automaton has 18362 states and 26138 transitions. Word has length 77 [2025-01-09 05:49:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:54,649 INFO L471 AbstractCegarLoop]: Abstraction has 18362 states and 26138 transitions. [2025-01-09 05:49:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-01-09 05:49:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18362 states and 26138 transitions. [2025-01-09 05:49:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:49:54,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:54,652 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] [2025-01-09 05:49:54,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:49:54,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:54,652 INFO L85 PathProgramCache]: Analyzing trace with hash -883203329, now seen corresponding path program 1 times [2025-01-09 05:49:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:54,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589636937] [2025-01-09 05:49:54,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:49:54,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:49:54,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:54,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:49:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589636937] [2025-01-09 05:49:54,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589636937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:54,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:54,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:49:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838114560] [2025-01-09 05:49:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:54,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:49:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:54,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:49:54,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:49:54,776 INFO L87 Difference]: Start difference. First operand 18362 states and 26138 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-01-09 05:49:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:55,197 INFO L93 Difference]: Finished difference Result 31014 states and 44256 transitions. [2025-01-09 05:49:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:49:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 79 [2025-01-09 05:49:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:55,228 INFO L225 Difference]: With dead ends: 31014 [2025-01-09 05:49:55,228 INFO L226 Difference]: Without dead ends: 28836 [2025-01-09 05:49:55,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:49:55,237 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 6324 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6324 SdHoareTripleChecker+Valid, 3756 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:55,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6324 Valid, 3756 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:49:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28836 states. [2025-01-09 05:49:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28836 to 20538. [2025-01-09 05:49:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20538 states, 20536 states have (on average 1.4239384495520062) internal successors, (29242), 20537 states have internal predecessors, (29242), 0 states have call successors, (0), 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-01-09 05:49:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20538 states to 20538 states and 29242 transitions. [2025-01-09 05:49:55,634 INFO L78 Accepts]: Start accepts. Automaton has 20538 states and 29242 transitions. Word has length 79 [2025-01-09 05:49:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:55,635 INFO L471 AbstractCegarLoop]: Abstraction has 20538 states and 29242 transitions. [2025-01-09 05:49:55,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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-01-09 05:49:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20538 states and 29242 transitions. [2025-01-09 05:49:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:49:55,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:55,638 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] [2025-01-09 05:49:55,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:49:55,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1710799524, now seen corresponding path program 1 times [2025-01-09 05:49:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906884081] [2025-01-09 05:49:55,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:55,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:49:55,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:49:55,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:55,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906884081] [2025-01-09 05:49:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906884081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:55,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892492532] [2025-01-09 05:49:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:55,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:55,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:55,701 INFO L87 Difference]: Start difference. First operand 20538 states and 29242 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-01-09 05:49:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:55,871 INFO L93 Difference]: Finished difference Result 34706 states and 49441 transitions. [2025-01-09 05:49:55,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 79 [2025-01-09 05:49:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:55,888 INFO L225 Difference]: With dead ends: 34706 [2025-01-09 05:49:55,888 INFO L226 Difference]: Without dead ends: 15712 [2025-01-09 05:49:55,903 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-01-09 05:49:55,904 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3117 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-01-09 05:49:55,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15712 states. [2025-01-09 05:49:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15712 to 15710. [2025-01-09 05:49:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15710 states, 15708 states have (on average 1.4289533995416348) internal successors, (22446), 15709 states have internal predecessors, (22446), 0 states have call successors, (0), 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-01-09 05:49:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 22446 transitions. [2025-01-09 05:49:56,251 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 22446 transitions. Word has length 79 [2025-01-09 05:49:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:56,251 INFO L471 AbstractCegarLoop]: Abstraction has 15710 states and 22446 transitions. [2025-01-09 05:49:56,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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-01-09 05:49:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 22446 transitions. [2025-01-09 05:49:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:49:56,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:56,253 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] [2025-01-09 05:49:56,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:49:56,253 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:56,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:56,254 INFO L85 PathProgramCache]: Analyzing trace with hash -594113331, now seen corresponding path program 1 times [2025-01-09 05:49:56,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977041293] [2025-01-09 05:49:56,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:56,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:56,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:49:56,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:49:56,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:56,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977041293] [2025-01-09 05:49:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977041293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:56,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:56,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306745315] [2025-01-09 05:49:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:56,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:56,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:56,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:56,337 INFO L87 Difference]: Start difference. First operand 15710 states and 22446 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-01-09 05:49:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:56,524 INFO L93 Difference]: Finished difference Result 22786 states and 32432 transitions. [2025-01-09 05:49:56,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:56,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 05:49:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:56,542 INFO L225 Difference]: With dead ends: 22786 [2025-01-09 05:49:56,545 INFO L226 Difference]: Without dead ends: 8640 [2025-01-09 05:49:56,565 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-01-09 05:49:56,569 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 45 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3102 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-01-09 05:49:56,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8640 states. [2025-01-09 05:49:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8640 to 8638. [2025-01-09 05:49:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8638 states, 8636 states have (on average 1.4309865678554887) internal successors, (12358), 8637 states have internal predecessors, (12358), 0 states have call successors, (0), 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-01-09 05:49:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8638 states to 8638 states and 12358 transitions. [2025-01-09 05:49:56,722 INFO L78 Accepts]: Start accepts. Automaton has 8638 states and 12358 transitions. Word has length 80 [2025-01-09 05:49:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:56,723 INFO L471 AbstractCegarLoop]: Abstraction has 8638 states and 12358 transitions. [2025-01-09 05:49:56,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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-01-09 05:49:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8638 states and 12358 transitions. [2025-01-09 05:49:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 05:49:56,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:56,724 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] [2025-01-09 05:49:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:49:56,724 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1560227327, now seen corresponding path program 1 times [2025-01-09 05:49:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810409234] [2025-01-09 05:49:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:56,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 05:49:56,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 05:49:56,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:56,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:56,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810409234] [2025-01-09 05:49:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810409234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:56,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:56,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194803335] [2025-01-09 05:49:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:56,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:56,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:56,796 INFO L87 Difference]: Start difference. First operand 8638 states and 12358 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-01-09 05:49:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:56,850 INFO L93 Difference]: Finished difference Result 12178 states and 17300 transitions. [2025-01-09 05:49:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-09 05:49:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:56,856 INFO L225 Difference]: With dead ends: 12178 [2025-01-09 05:49:56,856 INFO L226 Difference]: Without dead ends: 5104 [2025-01-09 05:49:56,861 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-01-09 05:49:56,864 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 42 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3087 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-01-09 05:49:56,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3087 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2025-01-09 05:49:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 5102. [2025-01-09 05:49:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5102 states, 5100 states have (on average 1.444313725490196) internal successors, (7366), 5101 states have internal predecessors, (7366), 0 states have call successors, (0), 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-01-09 05:49:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 7366 transitions. [2025-01-09 05:49:56,989 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 7366 transitions. Word has length 82 [2025-01-09 05:49:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:56,990 INFO L471 AbstractCegarLoop]: Abstraction has 5102 states and 7366 transitions. [2025-01-09 05:49:56,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-01-09 05:49:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 7366 transitions. [2025-01-09 05:49:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 05:49:56,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:56,991 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] [2025-01-09 05:49:56,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:49:56,991 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash -370457167, now seen corresponding path program 1 times [2025-01-09 05:49:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647826916] [2025-01-09 05:49:56,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:57,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 05:49:57,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 05:49:57,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:57,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:57,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647826916] [2025-01-09 05:49:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647826916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013321872] [2025-01-09 05:49:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:57,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:57,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:57,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:57,052 INFO L87 Difference]: Start difference. First operand 5102 states and 7366 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-01-09 05:49:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:57,088 INFO L93 Difference]: Finished difference Result 6874 states and 9812 transitions. [2025-01-09 05:49:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-01-09 05:49:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:57,092 INFO L225 Difference]: With dead ends: 6874 [2025-01-09 05:49:57,092 INFO L226 Difference]: Without dead ends: 3336 [2025-01-09 05:49:57,095 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-01-09 05:49:57,095 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 39 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3072 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-01-09 05:49:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3072 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2025-01-09 05:49:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3334. [2025-01-09 05:49:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3332 states have (on average 1.469387755102041) internal successors, (4896), 3333 states have internal predecessors, (4896), 0 states have call successors, (0), 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-01-09 05:49:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4896 transitions. [2025-01-09 05:49:57,135 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4896 transitions. Word has length 84 [2025-01-09 05:49:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:57,135 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4896 transitions. [2025-01-09 05:49:57,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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-01-09 05:49:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4896 transitions. [2025-01-09 05:49:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 05:49:57,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:57,136 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] [2025-01-09 05:49:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:49:57,136 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:57,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:57,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1277561885, now seen corresponding path program 1 times [2025-01-09 05:49:57,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:57,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216176663] [2025-01-09 05:49:57,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:57,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 05:49:57,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 05:49:57,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:57,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:57,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216176663] [2025-01-09 05:49:57,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216176663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:49:57,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:49:57,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:49:57,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122213480] [2025-01-09 05:49:57,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:49:57,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:49:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:57,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:49:57,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:49:57,190 INFO L87 Difference]: Start difference. First operand 3334 states and 4896 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-01-09 05:49:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:57,215 INFO L93 Difference]: Finished difference Result 4222 states and 6107 transitions. [2025-01-09 05:49:57,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:49:57,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-01-09 05:49:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:57,219 INFO L225 Difference]: With dead ends: 4222 [2025-01-09 05:49:57,219 INFO L226 Difference]: Without dead ends: 2452 [2025-01-09 05:49:57,220 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-01-09 05:49:57,221 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 36 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3057 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-01-09 05:49:57,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3057 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:49:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-01-09 05:49:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2450. [2025-01-09 05:49:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5008169934640523) internal successors, (3674), 2449 states have internal predecessors, (3674), 0 states have call successors, (0), 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-01-09 05:49:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3674 transitions. [2025-01-09 05:49:57,247 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3674 transitions. Word has length 86 [2025-01-09 05:49:57,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:57,248 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3674 transitions. [2025-01-09 05:49:57,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-01-09 05:49:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3674 transitions. [2025-01-09 05:49:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 05:49:57,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:57,249 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] [2025-01-09 05:49:57,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:49:57,249 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:57,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1236424853, now seen corresponding path program 1 times [2025-01-09 05:49:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:57,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592793090] [2025-01-09 05:49:57,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:57,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 05:49:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 05:49:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592793090] [2025-01-09 05:49:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592793090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:49:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423388372] [2025-01-09 05:49:57,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:57,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:57,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:57,895 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-01-09 05:49:57,896 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-01-09 05:49:57,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 05:49:58,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 05:49:58,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:58,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:58,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:49:58,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:49:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:58,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:49:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423388372] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:49:59,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:49:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:49:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288596234] [2025-01-09 05:49:59,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:49:59,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:49:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:59,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:49:59,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:49:59,447 INFO L87 Difference]: Start difference. First operand 2450 states and 3674 transitions. Second operand has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 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-01-09 05:50:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:00,697 INFO L93 Difference]: Finished difference Result 6208 states and 8738 transitions. [2025-01-09 05:50:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 05:50:00,698 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 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 88 [2025-01-09 05:50:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:00,703 INFO L225 Difference]: With dead ends: 6208 [2025-01-09 05:50:00,703 INFO L226 Difference]: Without dead ends: 5322 [2025-01-09 05:50:00,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=657, Invalid=2423, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:50:00,707 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 14399 mSDsluCounter, 6329 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14399 SdHoareTripleChecker+Valid, 7831 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:00,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14399 Valid, 7831 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:50:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2025-01-09 05:50:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5284. [2025-01-09 05:50:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5284 states, 5282 states have (on average 1.4117758424839075) internal successors, (7457), 5283 states have internal predecessors, (7457), 0 states have call successors, (0), 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-01-09 05:50:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 7457 transitions. [2025-01-09 05:50:00,838 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 7457 transitions. Word has length 88 [2025-01-09 05:50:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:00,838 INFO L471 AbstractCegarLoop]: Abstraction has 5284 states and 7457 transitions. [2025-01-09 05:50:00,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 27 states have internal predecessors, (218), 0 states have call successors, (0), 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-01-09 05:50:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 7457 transitions. [2025-01-09 05:50:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:50:00,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:00,840 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] [2025-01-09 05:50:00,847 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-01-09 05:50:01,040 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,SelfDestructingSolverStorable22 [2025-01-09 05:50:01,040 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1008908801, now seen corresponding path program 1 times [2025-01-09 05:50:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243754117] [2025-01-09 05:50:01,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:01,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:50:01,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:50:01,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:01,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:01,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:01,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243754117] [2025-01-09 05:50:01,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243754117] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:50:01,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082859302] [2025-01-09 05:50:01,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:01,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:50:01,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:50:01,360 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-01-09 05:50:01,363 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-01-09 05:50:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:50:01,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:50:01,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:01,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:01,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 05:50:01,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:50:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:50:01,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:50:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:50:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082859302] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:50:01,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:50:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-01-09 05:50:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398814751] [2025-01-09 05:50:01,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:50:01,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 05:50:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:01,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 05:50:01,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:50:01,758 INFO L87 Difference]: Start difference. First operand 5284 states and 7457 transitions. Second operand has 16 states, 16 states have (on average 15.625) internal successors, (250), 16 states have internal predecessors, (250), 0 states have call successors, (0), 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-01-09 05:50:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:02,980 INFO L93 Difference]: Finished difference Result 19688 states and 26477 transitions. [2025-01-09 05:50:02,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 05:50:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.625) internal successors, (250), 16 states have internal predecessors, (250), 0 states have call successors, (0), 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 89 [2025-01-09 05:50:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:02,994 INFO L225 Difference]: With dead ends: 19688 [2025-01-09 05:50:02,994 INFO L226 Difference]: Without dead ends: 15968 [2025-01-09 05:50:03,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 05:50:03,005 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 11629 mSDsluCounter, 7983 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11629 SdHoareTripleChecker+Valid, 9529 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:03,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11629 Valid, 9529 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:50:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15968 states. [2025-01-09 05:50:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15968 to 15882. [2025-01-09 05:50:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15882 states, 15880 states have (on average 1.297103274559194) internal successors, (20598), 15881 states have internal predecessors, (20598), 0 states have call successors, (0), 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-01-09 05:50:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15882 states to 15882 states and 20598 transitions. [2025-01-09 05:50:03,331 INFO L78 Accepts]: Start accepts. Automaton has 15882 states and 20598 transitions. Word has length 89 [2025-01-09 05:50:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:03,331 INFO L471 AbstractCegarLoop]: Abstraction has 15882 states and 20598 transitions. [2025-01-09 05:50:03,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.625) internal successors, (250), 16 states have internal predecessors, (250), 0 states have call successors, (0), 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-01-09 05:50:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 15882 states and 20598 transitions. [2025-01-09 05:50:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:50:03,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:03,333 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 05:50:03,343 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-01-09 05:50:03,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:50:03,533 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:03,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash -472155423, now seen corresponding path program 1 times [2025-01-09 05:50:03,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:03,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152179606] [2025-01-09 05:50:03,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:03,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:50:03,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:50:03,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:03,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:03,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152179606] [2025-01-09 05:50:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152179606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:50:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642426438] [2025-01-09 05:50:03,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:03,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:50:03,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:50:03,788 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-01-09 05:50:03,791 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-01-09 05:50:03,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:50:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:50:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:03,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:50:03,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:50:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:04,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:50:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642426438] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:50:04,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:50:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-09 05:50:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680719291] [2025-01-09 05:50:04,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:50:04,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:50:04,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:04,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:50:04,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:50:04,890 INFO L87 Difference]: Start difference. First operand 15882 states and 20598 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 21 states have internal predecessors, (209), 0 states have call successors, (0), 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-01-09 05:50:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:05,637 INFO L93 Difference]: Finished difference Result 44446 states and 56981 transitions. [2025-01-09 05:50:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:50:05,637 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 21 states have internal predecessors, (209), 0 states have call successors, (0), 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 89 [2025-01-09 05:50:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:05,669 INFO L225 Difference]: With dead ends: 44446 [2025-01-09 05:50:05,670 INFO L226 Difference]: Without dead ends: 30759 [2025-01-09 05:50:05,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:50:05,685 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 7753 mSDsluCounter, 4718 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7753 SdHoareTripleChecker+Valid, 6236 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:05,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7753 Valid, 6236 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:50:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30759 states. [2025-01-09 05:50:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30759 to 30387. [2025-01-09 05:50:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30387 states, 30385 states have (on average 1.2687510284679941) internal successors, (38551), 30386 states have internal predecessors, (38551), 0 states have call successors, (0), 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-01-09 05:50:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30387 states to 30387 states and 38551 transitions. [2025-01-09 05:50:06,447 INFO L78 Accepts]: Start accepts. Automaton has 30387 states and 38551 transitions. Word has length 89 [2025-01-09 05:50:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:06,447 INFO L471 AbstractCegarLoop]: Abstraction has 30387 states and 38551 transitions. [2025-01-09 05:50:06,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 21 states have internal predecessors, (209), 0 states have call successors, (0), 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-01-09 05:50:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 30387 states and 38551 transitions. [2025-01-09 05:50:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:50:06,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:06,448 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:50:06,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:50:06,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:50:06,649 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:06,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1755296695, now seen corresponding path program 1 times [2025-01-09 05:50:06,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:06,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204284066] [2025-01-09 05:50:06,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:06,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:50:06,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:50:06,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:06,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204284066] [2025-01-09 05:50:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204284066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:50:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266354760] [2025-01-09 05:50:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:06,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:50:06,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:50:06,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:50:06,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:50:06,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:50:06,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:50:06,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:06,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:06,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:50:06,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:50:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:07,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:50:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266354760] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:50:08,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:50:08,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:50:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272352228] [2025-01-09 05:50:08,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:50:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:50:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:50:08,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:50:08,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:50:08,008 INFO L87 Difference]: Start difference. First operand 30387 states and 38551 transitions. Second operand has 23 states, 23 states have (on average 9.521739130434783) internal successors, (219), 22 states have internal predecessors, (219), 0 states have call successors, (0), 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-01-09 05:50:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:50:09,441 INFO L93 Difference]: Finished difference Result 84259 states and 106363 transitions. [2025-01-09 05:50:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:50:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.521739130434783) internal successors, (219), 22 states have internal predecessors, (219), 0 states have call successors, (0), 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-01-09 05:50:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:50:09,500 INFO L225 Difference]: With dead ends: 84259 [2025-01-09 05:50:09,501 INFO L226 Difference]: Without dead ends: 60002 [2025-01-09 05:50:09,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 05:50:09,514 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 10610 mSDsluCounter, 4855 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10610 SdHoareTripleChecker+Valid, 6376 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:50:09,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10610 Valid, 6376 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:50:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60002 states. [2025-01-09 05:50:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60002 to 59262. [2025-01-09 05:50:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59262 states, 59260 states have (on average 1.2469287883901452) internal successors, (73893), 59261 states have internal predecessors, (73893), 0 states have call successors, (0), 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-01-09 05:50:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59262 states to 59262 states and 73893 transitions. [2025-01-09 05:50:10,885 INFO L78 Accepts]: Start accepts. Automaton has 59262 states and 73893 transitions. Word has length 90 [2025-01-09 05:50:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:50:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 59262 states and 73893 transitions. [2025-01-09 05:50:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.521739130434783) internal successors, (219), 22 states have internal predecessors, (219), 0 states have call successors, (0), 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-01-09 05:50:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 59262 states and 73893 transitions. [2025-01-09 05:50:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:50:10,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:50:10,887 INFO L218 NwaCegarLoop]: trace histogram [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-01-09 05:50:10,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:50:11,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 05:50:11,091 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:50:11,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:50:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash 14662161, now seen corresponding path program 1 times [2025-01-09 05:50:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:50:11,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777049077] [2025-01-09 05:50:11,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:50:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:50:11,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:50:11,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:11,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:50:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:50:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777049077] [2025-01-09 05:50:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777049077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:50:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079185420] [2025-01-09 05:50:11,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:50:11,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:50:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:50:11,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:50:11,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:50:11,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:50:11,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:50:11,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:50:11,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:50:11,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 05:50:11,404 INFO L279 TraceCheckSpWp]: Computing forward predicates...