./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label04.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.4.1.ufo.BOUNDED-8.pals+Problem12_label04.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 76db29d9ca8ef7eef9a15a62e4507820e0c810b40a6129bc4bf7f78be54c22c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:44:49,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:44:49,789 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:44:49,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:44:49,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:44:49,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:44:49,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:44:49,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:44:49,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:44:49,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:44:49,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:44:49,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:44:49,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:44:49,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:44:49,816 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:44:49,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:44:49,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:44:49,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:44:49,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:44:49,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:44:49,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:44:49,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:44:49,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:44:49,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:44:49,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:44:49,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:44:49,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:44:49,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:44:49,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:44:49,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:44:49,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:44:49,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:44:49,821 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 -> 76db29d9ca8ef7eef9a15a62e4507820e0c810b40a6129bc4bf7f78be54c22c5 [2025-01-09 05:44:50,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:44:50,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:44:50,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:44:50,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:44:50,042 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:44:50,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-01-09 05:44:51,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f9050bc3/c97c1595fc7a4b749d6521ce8c444fab/FLAGb3fb3f7fe [2025-01-09 05:44:51,619 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:44:51,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-01-09 05:44:51,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f9050bc3/c97c1595fc7a4b749d6521ce8c444fab/FLAGb3fb3f7fe [2025-01-09 05:44:51,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f9050bc3/c97c1595fc7a4b749d6521ce8c444fab [2025-01-09 05:44:51,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:44:51,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:44:51,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:44:51,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:44:51,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:44:51,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:44:51" (1/1) ... [2025-01-09 05:44:51,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345b2a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:51, skipping insertion in model container [2025-01-09 05:44:51,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:44:51" (1/1) ... [2025-01-09 05:44:51,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:44:52,045 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.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c[8653,8666] [2025-01-09 05:44:52,088 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.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c[15714,15727] [2025-01-09 05:44:52,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:44:52,491 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:44:52,519 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.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c[8653,8666] [2025-01-09 05:44:52,532 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.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c[15714,15727] [2025-01-09 05:44:52,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:44:52,817 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:44:52,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52 WrapperNode [2025-01-09 05:44:52,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:44:52,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:44:52,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:44:52,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:44:52,823 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:44:52" (1/1) ... [2025-01-09 05:44:52,865 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:44:52" (1/1) ... [2025-01-09 05:44:53,073 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5034 [2025-01-09 05:44:53,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:44:53,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:44:53,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:44:53,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:44:53,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,259 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:44:53,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:44:53,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:44:53,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:44:53,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:44:53,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (1/1) ... [2025-01-09 05:44:53,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:44:53,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:44:53,520 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:44:53,523 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:44:53,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:44:53,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:44:53,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:44:53,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:44:53,618 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:44:53,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:44:56,749 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-01-09 05:44:56,749 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:44:56,777 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:44:56,781 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:44:56,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:44:56 BoogieIcfgContainer [2025-01-09 05:44:56,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:44:56,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:44:56,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:44:56,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:44:56,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:44:51" (1/3) ... [2025-01-09 05:44:56,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6319e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:44:56, skipping insertion in model container [2025-01-09 05:44:56,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:44:52" (2/3) ... [2025-01-09 05:44:56,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6319e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:44:56, skipping insertion in model container [2025-01-09 05:44:56,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:44:56" (3/3) ... [2025-01-09 05:44:56,789 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c [2025-01-09 05:44:56,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:44:56,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label04.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:44:56,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:44:56,868 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;@2c8d8c95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:44:56,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:44:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 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:44:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:44:56,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:56,882 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] [2025-01-09 05:44:56,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:56,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1605999950, now seen corresponding path program 1 times [2025-01-09 05:44:56,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143425534] [2025-01-09 05:44:56,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:56,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:44:56,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:44:56,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:57,071 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:44:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143425534] [2025-01-09 05:44:57,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143425534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:44:57,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419390559] [2025-01-09 05:44:57,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:44:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:57,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:44:57,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:44:57,092 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:44:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:57,143 INFO L93 Difference]: Finished difference Result 1739 states and 3302 transitions. [2025-01-09 05:44:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:44:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-01-09 05:44:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:57,156 INFO L225 Difference]: With dead ends: 1739 [2025-01-09 05:44:57,156 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 05:44:57,162 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:44:57,165 INFO L435 NwaCegarLoop]: 1614 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, 1614 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:44:57,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 05:44:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-01-09 05:44:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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:44:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-01-09 05:44:57,229 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-01-09 05:44:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:57,229 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-01-09 05:44:57,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:44:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-01-09 05:44:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:44:57,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:57,232 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] [2025-01-09 05:44:57,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:44:57,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:57,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash 584931596, now seen corresponding path program 1 times [2025-01-09 05:44:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026974264] [2025-01-09 05:44:57,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:57,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:44:57,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:44:57,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:57,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:57,407 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:44:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:57,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026974264] [2025-01-09 05:44:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026974264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:57,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:57,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108322468] [2025-01-09 05:44:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:57,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:57,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:57,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:57,410 INFO L87 Difference]: Start difference. First operand 819 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:44:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:57,494 INFO L93 Difference]: Finished difference Result 895 states and 1666 transitions. [2025-01-09 05:44:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:44:57,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-01-09 05:44:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:57,498 INFO L225 Difference]: With dead ends: 895 [2025-01-09 05:44:57,498 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 05:44:57,499 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:44:57,499 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:57,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 05:44:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 819. [2025-01-09 05:44:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 states have internal predecessors, (1525), 0 states have call successors, (0), 0 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:44:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-01-09 05:44:57,517 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-01-09 05:44:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:57,517 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-01-09 05:44:57,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:44:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-01-09 05:44:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 05:44:57,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:57,518 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] [2025-01-09 05:44:57,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:44:57,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:57,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1015331463, now seen corresponding path program 1 times [2025-01-09 05:44:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:57,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787809918] [2025-01-09 05:44:57,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:57,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 05:44:57,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 05:44:57,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:57,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:57,706 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:44:57,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:57,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787809918] [2025-01-09 05:44:57,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787809918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:57,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:57,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:44:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878292373] [2025-01-09 05:44:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:57,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:44:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:57,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:44:57,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:44:57,707 INFO L87 Difference]: Start difference. First operand 819 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:44:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:57,858 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-01-09 05:44:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:44:57,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-01-09 05:44:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:57,862 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 05:44:57,862 INFO L226 Difference]: Without dead ends: 1071 [2025-01-09 05:44:57,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:44:57,863 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:57,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:44:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-09 05:44:57,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-01-09 05:44:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8554641598119859) internal successors, (1579), 852 states have internal predecessors, (1579), 0 states have call successors, (0), 0 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:44:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-01-09 05:44:57,888 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-01-09 05:44:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:57,888 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-01-09 05:44:57,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:44:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-01-09 05:44:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:44:57,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:57,891 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] [2025-01-09 05:44:57,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:44:57,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:57,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash -639739561, now seen corresponding path program 1 times [2025-01-09 05:44:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188120805] [2025-01-09 05:44:57,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:57,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:44:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:44:57,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:57,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:57,985 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:44:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:57,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188120805] [2025-01-09 05:44:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188120805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:57,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:57,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73728571] [2025-01-09 05:44:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:57,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:57,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:57,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:57,988 INFO L87 Difference]: Start difference. First operand 853 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:44:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,019 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-01-09 05:44:58,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-01-09 05:44:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,023 INFO L225 Difference]: With dead ends: 982 [2025-01-09 05:44:58,023 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:44:58,024 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:44:58,024 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:58,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:44:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:44:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:44:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-01-09 05:44:58,042 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-01-09 05:44:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:58,042 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-01-09 05:44:58,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:44:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-01-09 05:44:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:44:58,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:58,043 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] [2025-01-09 05:44:58,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:44:58,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:58,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash -573246049, now seen corresponding path program 1 times [2025-01-09 05:44:58,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:58,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956978280] [2025-01-09 05:44:58,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:58,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:44:58,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:44:58,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:58,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:58,253 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:44:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956978280] [2025-01-09 05:44:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956978280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:58,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:58,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:44:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891154091] [2025-01-09 05:44:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:44:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:58,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:44:58,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:44:58,255 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:44:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,357 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-01-09 05:44:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:44:58,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-01-09 05:44:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,361 INFO L225 Difference]: With dead ends: 1039 [2025-01-09 05:44:58,361 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:44:58,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:44:58,362 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4446 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:58,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 1678 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:58,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:44:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:44:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8337004405286343) internal successors, (1665), 909 states have internal predecessors, (1665), 0 states have call successors, (0), 0 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:44:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-01-09 05:44:58,382 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-01-09 05:44:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:58,383 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-01-09 05:44:58,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:44:58,383 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-01-09 05:44:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 05:44:58,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:58,385 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] [2025-01-09 05:44:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:44:58,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:58,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1005481493, now seen corresponding path program 1 times [2025-01-09 05:44:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158751021] [2025-01-09 05:44:58,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:58,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 05:44:58,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 05:44:58,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:58,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:58,531 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:44:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158751021] [2025-01-09 05:44:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158751021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:44:58,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33244393] [2025-01-09 05:44:58,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:44:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:58,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:44:58,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:44:58,532 INFO L87 Difference]: Start difference. First operand 910 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:44:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,562 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-01-09 05:44:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:44:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-01-09 05:44:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,566 INFO L225 Difference]: With dead ends: 918 [2025-01-09 05:44:58,566 INFO L226 Difference]: Without dead ends: 916 [2025-01-09 05:44:58,566 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:44:58,567 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:44:58,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-01-09 05:44:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-01-09 05:44:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8271334792122538) internal successors, (1670), 915 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:44:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-01-09 05:44:58,584 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-01-09 05:44:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:58,585 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-01-09 05:44:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:44:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-01-09 05:44:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:44:58,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:58,586 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] [2025-01-09 05:44:58,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:44:58,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:58,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -467852289, now seen corresponding path program 1 times [2025-01-09 05:44:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627294391] [2025-01-09 05:44:58,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:58,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:44:58,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:44:58,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:58,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:58,675 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:44:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627294391] [2025-01-09 05:44:58,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627294391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:58,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:58,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366852496] [2025-01-09 05:44:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:58,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:58,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:58,676 INFO L87 Difference]: Start difference. First operand 916 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,697 INFO L93 Difference]: Finished difference Result 1062 states and 1891 transitions. [2025-01-09 05:44:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 05:44:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,700 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 05:44:58,700 INFO L226 Difference]: Without dead ends: 986 [2025-01-09 05:44:58,701 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:44:58,701 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 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:44:58,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-01-09 05:44:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2025-01-09 05:44:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 982 states have (on average 1.8034623217922607) internal successors, (1771), 983 states have internal predecessors, (1771), 0 states have call successors, (0), 0 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:44:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1771 transitions. [2025-01-09 05:44:58,717 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1771 transitions. Word has length 48 [2025-01-09 05:44:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:58,718 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1771 transitions. [2025-01-09 05:44:58,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1771 transitions. [2025-01-09 05:44:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:44:58,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:58,718 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] [2025-01-09 05:44:58,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:44:58,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:58,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 770409727, now seen corresponding path program 1 times [2025-01-09 05:44:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:58,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739614878] [2025-01-09 05:44:58,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:44:58,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:44:58,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:58,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:58,755 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:44:58,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:58,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739614878] [2025-01-09 05:44:58,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739614878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:58,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:58,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:58,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214157945] [2025-01-09 05:44:58,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:58,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:58,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:58,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:58,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:58,756 INFO L87 Difference]: Start difference. First operand 984 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,775 INFO L93 Difference]: Finished difference Result 1358 states and 2331 transitions. [2025-01-09 05:44:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:58,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 05:44:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,779 INFO L225 Difference]: With dead ends: 1358 [2025-01-09 05:44:58,779 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 05:44:58,780 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:44:58,780 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 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:44:58,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 05:44:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-01-09 05:44:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1155 states have (on average 1.7515151515151515) internal successors, (2023), 1156 states have internal predecessors, (2023), 0 states have call successors, (0), 0 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:44:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2023 transitions. [2025-01-09 05:44:58,799 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2023 transitions. Word has length 48 [2025-01-09 05:44:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:58,799 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 2023 transitions. [2025-01-09 05:44:58,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2023 transitions. [2025-01-09 05:44:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:44:58,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:58,800 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] [2025-01-09 05:44:58,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:44:58,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:58,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1445059073, now seen corresponding path program 1 times [2025-01-09 05:44:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227679721] [2025-01-09 05:44:58,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:58,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:44:58,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:44:58,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:58,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:58,836 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:44:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227679721] [2025-01-09 05:44:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227679721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:58,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:58,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:58,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225254177] [2025-01-09 05:44:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:58,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:58,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:58,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:58,838 INFO L87 Difference]: Start difference. First operand 1157 states and 2023 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,860 INFO L93 Difference]: Finished difference Result 1853 states and 3045 transitions. [2025-01-09 05:44:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 05:44:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,865 INFO L225 Difference]: With dead ends: 1853 [2025-01-09 05:44:58,865 INFO L226 Difference]: Without dead ends: 1481 [2025-01-09 05:44:58,866 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:44:58,866 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 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:44:58,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-01-09 05:44:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2025-01-09 05:44:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 1.6784021665538253) internal successors, (2479), 1478 states have internal predecessors, (2479), 0 states have call successors, (0), 0 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:44:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2479 transitions. [2025-01-09 05:44:58,894 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2479 transitions. Word has length 48 [2025-01-09 05:44:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:58,894 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2479 transitions. [2025-01-09 05:44:58,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2479 transitions. [2025-01-09 05:44:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:44:58,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:58,895 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] [2025-01-09 05:44:58,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:44:58,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 335873791, now seen corresponding path program 1 times [2025-01-09 05:44:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780094739] [2025-01-09 05:44:58,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:58,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:44:58,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:44:58,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:58,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:58,935 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:44:58,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780094739] [2025-01-09 05:44:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780094739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:58,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:58,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:58,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665706129] [2025-01-09 05:44:58,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:58,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:44:58,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:58,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:44:58,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:44:58,937 INFO L87 Difference]: Start difference. First operand 1479 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:44:58,963 INFO L93 Difference]: Finished difference Result 2771 states and 4329 transitions. [2025-01-09 05:44:58,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:44:58,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 05:44:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:44:58,970 INFO L225 Difference]: With dead ends: 2771 [2025-01-09 05:44:58,970 INFO L226 Difference]: Without dead ends: 2077 [2025-01-09 05:44:58,971 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:44:58,971 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 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:44:58,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:44:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-01-09 05:44:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-01-09 05:44:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2073 states have (on average 1.5894838398456343) internal successors, (3295), 2074 states have internal predecessors, (3295), 0 states have call successors, (0), 0 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:44:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3295 transitions. [2025-01-09 05:44:59,004 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3295 transitions. Word has length 48 [2025-01-09 05:44:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:44:59,005 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3295 transitions. [2025-01-09 05:44:59,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:44:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3295 transitions. [2025-01-09 05:44:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 05:44:59,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:44:59,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:44:59,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:44:59,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:44:59,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:44:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash -373800623, now seen corresponding path program 1 times [2025-01-09 05:44:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:44:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342857514] [2025-01-09 05:44:59,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:44:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:44:59,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:44:59,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:44:59,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:44:59,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:44:59,093 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:44:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:44:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342857514] [2025-01-09 05:44:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342857514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:44:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:44:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:44:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629875984] [2025-01-09 05:44:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:44:59,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:44:59,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:44:59,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:44:59,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:44:59,094 INFO L87 Difference]: Start difference. First operand 2075 states and 3295 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:45:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:03,577 INFO L93 Difference]: Finished difference Result 4330 states and 7604 transitions. [2025-01-09 05:45:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:45:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-01-09 05:45:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:03,587 INFO L225 Difference]: With dead ends: 4330 [2025-01-09 05:45:03,587 INFO L226 Difference]: Without dead ends: 3577 [2025-01-09 05:45:03,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:45:03,588 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 2363 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2363 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:03,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2363 Valid, 779 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 05:45:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2025-01-09 05:45:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3577. [2025-01-09 05:45:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3575 states have (on average 1.513006993006993) internal successors, (5409), 3576 states have internal predecessors, (5409), 0 states have call successors, (0), 0 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:45:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5409 transitions. [2025-01-09 05:45:03,642 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 5409 transitions. Word has length 61 [2025-01-09 05:45:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:03,642 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 5409 transitions. [2025-01-09 05:45:03,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:45:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 5409 transitions. [2025-01-09 05:45:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:03,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:03,646 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] [2025-01-09 05:45:03,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:45:03,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:03,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash -161363137, now seen corresponding path program 1 times [2025-01-09 05:45:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:03,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605434115] [2025-01-09 05:45:03,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:03,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:03,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:03,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:03,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:45:03,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605434115] [2025-01-09 05:45:03,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605434115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:03,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:03,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754346147] [2025-01-09 05:45:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:03,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:03,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:03,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:03,749 INFO L87 Difference]: Start difference. First operand 3577 states and 5409 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:45:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:03,880 INFO L93 Difference]: Finished difference Result 8667 states and 12598 transitions. [2025-01-09 05:45:03,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:03,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:45:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:03,898 INFO L225 Difference]: With dead ends: 8667 [2025-01-09 05:45:03,898 INFO L226 Difference]: Without dead ends: 7737 [2025-01-09 05:45:03,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:03,902 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:03,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2025-01-09 05:45:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 4689. [2025-01-09 05:45:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4687 states have (on average 1.4851717516535097) internal successors, (6961), 4688 states have internal predecessors, (6961), 0 states have call successors, (0), 0 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:45:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 6961 transitions. [2025-01-09 05:45:04,003 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 6961 transitions. Word has length 65 [2025-01-09 05:45:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:04,004 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 6961 transitions. [2025-01-09 05:45:04,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:45:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 6961 transitions. [2025-01-09 05:45:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:04,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:04,007 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] [2025-01-09 05:45:04,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:45:04,007 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:04,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1076898879, now seen corresponding path program 1 times [2025-01-09 05:45:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824091072] [2025-01-09 05:45:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:04,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:04,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:04,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:04,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:45:04,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:04,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824091072] [2025-01-09 05:45:04,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824091072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:04,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:04,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865329169] [2025-01-09 05:45:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:04,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:04,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:04,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:04,099 INFO L87 Difference]: Start difference. First operand 4689 states and 6961 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:45:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:04,265 INFO L93 Difference]: Finished difference Result 9955 states and 14406 transitions. [2025-01-09 05:45:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:45:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:04,289 INFO L225 Difference]: With dead ends: 9955 [2025-01-09 05:45:04,289 INFO L226 Difference]: Without dead ends: 8665 [2025-01-09 05:45:04,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:04,292 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:04,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-01-09 05:45:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 6441. [2025-01-09 05:45:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6441 states, 6439 states have (on average 1.4600093182171145) internal successors, (9401), 6440 states have internal predecessors, (9401), 0 states have call successors, (0), 0 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:45:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 9401 transitions. [2025-01-09 05:45:04,420 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 9401 transitions. Word has length 65 [2025-01-09 05:45:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:04,420 INFO L471 AbstractCegarLoop]: Abstraction has 6441 states and 9401 transitions. [2025-01-09 05:45:04,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:45:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 9401 transitions. [2025-01-09 05:45:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:04,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:04,422 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] [2025-01-09 05:45:04,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:45:04,422 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:04,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1138569921, now seen corresponding path program 1 times [2025-01-09 05:45:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804021795] [2025-01-09 05:45:04,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:04,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:04,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:04,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:04,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:45:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:04,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804021795] [2025-01-09 05:45:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804021795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:04,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:04,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326024455] [2025-01-09 05:45:04,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:04,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:04,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:04,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:04,515 INFO L87 Difference]: Start difference. First operand 6441 states and 9401 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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:45:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:04,660 INFO L93 Difference]: Finished difference Result 11243 states and 16206 transitions. [2025-01-09 05:45:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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 65 [2025-01-09 05:45:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:04,675 INFO L225 Difference]: With dead ends: 11243 [2025-01-09 05:45:04,676 INFO L226 Difference]: Without dead ends: 9953 [2025-01-09 05:45:04,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:04,680 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4671 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4671 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:04,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4671 Valid, 3336 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2025-01-09 05:45:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 7729. [2025-01-09 05:45:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7729 states, 7727 states have (on average 1.4495923385531253) internal successors, (11201), 7728 states have internal predecessors, (11201), 0 states have call successors, (0), 0 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:45:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 11201 transitions. [2025-01-09 05:45:04,828 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 11201 transitions. Word has length 65 [2025-01-09 05:45:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:04,829 INFO L471 AbstractCegarLoop]: Abstraction has 7729 states and 11201 transitions. [2025-01-09 05:45:04,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 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:45:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 11201 transitions. [2025-01-09 05:45:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:04,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:04,831 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] [2025-01-09 05:45:04,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:45:04,831 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:04,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 642362943, now seen corresponding path program 1 times [2025-01-09 05:45:04,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:04,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218314651] [2025-01-09 05:45:04,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:04,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:04,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:04,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:04,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:45:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218314651] [2025-01-09 05:45:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218314651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460724771] [2025-01-09 05:45:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:04,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:04,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:04,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:04,916 INFO L87 Difference]: Start difference. First operand 7729 states and 11201 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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:45:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:05,117 INFO L93 Difference]: Finished difference Result 12531 states and 18006 transitions. [2025-01-09 05:45:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:05,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 65 [2025-01-09 05:45:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:05,134 INFO L225 Difference]: With dead ends: 12531 [2025-01-09 05:45:05,134 INFO L226 Difference]: Without dead ends: 11241 [2025-01-09 05:45:05,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:05,139 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4661 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:05,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 3359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2025-01-09 05:45:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 9017. [2025-01-09 05:45:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4421519689406546) internal successors, (13001), 9016 states have internal predecessors, (13001), 0 states have call successors, (0), 0 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:45:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 13001 transitions. [2025-01-09 05:45:05,301 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 13001 transitions. Word has length 65 [2025-01-09 05:45:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:05,301 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 13001 transitions. [2025-01-09 05:45:05,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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:45:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 13001 transitions. [2025-01-09 05:45:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 05:45:05,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:05,303 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] [2025-01-09 05:45:05,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:45:05,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:05,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1093101628, now seen corresponding path program 1 times [2025-01-09 05:45:05,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284417554] [2025-01-09 05:45:05,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:05,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:05,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 05:45:05,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 05:45:05,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:05,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:05,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:05,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284417554] [2025-01-09 05:45:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284417554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:05,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132355683] [2025-01-09 05:45:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:05,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:05,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:05,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:05,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:05,372 INFO L87 Difference]: Start difference. First operand 9017 states and 13001 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:45:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:05,458 INFO L93 Difference]: Finished difference Result 15749 states and 22419 transitions. [2025-01-09 05:45:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:05,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-01-09 05:45:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:05,473 INFO L225 Difference]: With dead ends: 15749 [2025-01-09 05:45:05,473 INFO L226 Difference]: Without dead ends: 9019 [2025-01-09 05:45:05,481 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:45:05,482 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 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:45:05,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2025-01-09 05:45:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 9017. [2025-01-09 05:45:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4283971159179145) internal successors, (12877), 9016 states have internal predecessors, (12877), 0 states have call successors, (0), 0 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:45:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 12877 transitions. [2025-01-09 05:45:05,623 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 12877 transitions. Word has length 66 [2025-01-09 05:45:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:05,623 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 12877 transitions. [2025-01-09 05:45:05,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 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:45:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 12877 transitions. [2025-01-09 05:45:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:45:05,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:05,625 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] [2025-01-09 05:45:05,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:45:05,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:05,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:05,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1536501417, now seen corresponding path program 1 times [2025-01-09 05:45:05,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:05,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114336974] [2025-01-09 05:45:05,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:05,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:05,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:45:05,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:45:05,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:05,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114336974] [2025-01-09 05:45:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114336974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418498827] [2025-01-09 05:45:05,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:05,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:05,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:05,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:05,695 INFO L87 Difference]: Start difference. First operand 9017 states and 12877 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:05,772 INFO L93 Difference]: Finished difference Result 11590 states and 16461 transitions. [2025-01-09 05:45:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:45:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:05,779 INFO L225 Difference]: With dead ends: 11590 [2025-01-09 05:45:05,779 INFO L226 Difference]: Without dead ends: 4860 [2025-01-09 05:45:05,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:05,784 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 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:45:05,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2025-01-09 05:45:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4852. [2025-01-09 05:45:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4850 states have (on average 1.4672164948453608) internal successors, (7116), 4851 states have internal predecessors, (7116), 0 states have call successors, (0), 0 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:45:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7116 transitions. [2025-01-09 05:45:05,853 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7116 transitions. Word has length 67 [2025-01-09 05:45:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:05,853 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 7116 transitions. [2025-01-09 05:45:05,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7116 transitions. [2025-01-09 05:45:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:45:05,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:05,854 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] [2025-01-09 05:45:05,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:45:05,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:05,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1693309582, now seen corresponding path program 1 times [2025-01-09 05:45:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119267309] [2025-01-09 05:45:05,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:05,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:45:05,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:45:05,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:05,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:05,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:05,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119267309] [2025-01-09 05:45:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119267309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:05,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:05,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157753462] [2025-01-09 05:45:05,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:05,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:05,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:05,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:05,922 INFO L87 Difference]: Start difference. First operand 4852 states and 7116 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:45:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:05,952 INFO L93 Difference]: Finished difference Result 6132 states and 8878 transitions. [2025-01-09 05:45:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 05:45:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:05,959 INFO L225 Difference]: With dead ends: 6132 [2025-01-09 05:45:05,959 INFO L226 Difference]: Without dead ends: 3578 [2025-01-09 05:45:05,962 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:45:05,962 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 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:45:05,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-01-09 05:45:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-01-09 05:45:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3574 states have (on average 1.4924454392837156) internal successors, (5334), 3575 states have internal predecessors, (5334), 0 states have call successors, (0), 0 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:45:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5334 transitions. [2025-01-09 05:45:06,008 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5334 transitions. Word has length 68 [2025-01-09 05:45:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:06,008 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5334 transitions. [2025-01-09 05:45:06,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:45:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5334 transitions. [2025-01-09 05:45:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 05:45:06,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:06,010 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] [2025-01-09 05:45:06,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:45:06,010 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2022357856, now seen corresponding path program 1 times [2025-01-09 05:45:06,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439194245] [2025-01-09 05:45:06,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:06,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:06,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 05:45:06,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 05:45:06,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:06,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:06,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:06,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439194245] [2025-01-09 05:45:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439194245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:06,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:06,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:06,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100524749] [2025-01-09 05:45:06,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:06,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:06,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:06,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:06,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:06,072 INFO L87 Difference]: Start difference. First operand 3576 states and 5334 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:45:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:06,094 INFO L93 Difference]: Finished difference Result 4218 states and 6205 transitions. [2025-01-09 05:45:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:06,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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 70 [2025-01-09 05:45:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:06,099 INFO L225 Difference]: With dead ends: 4218 [2025-01-09 05:45:06,099 INFO L226 Difference]: Without dead ends: 2940 [2025-01-09 05:45:06,100 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:45:06,100 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 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:45:06,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-01-09 05:45:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2025-01-09 05:45:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5170299727520435) internal successors, (4454), 2937 states have internal predecessors, (4454), 0 states have call successors, (0), 0 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:45:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4454 transitions. [2025-01-09 05:45:06,129 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4454 transitions. Word has length 70 [2025-01-09 05:45:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:06,129 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4454 transitions. [2025-01-09 05:45:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:45:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4454 transitions. [2025-01-09 05:45:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 05:45:06,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:06,130 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] [2025-01-09 05:45:06,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:45:06,130 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1521538382, now seen corresponding path program 1 times [2025-01-09 05:45:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138778166] [2025-01-09 05:45:06,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:06,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:45:06,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:45:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:45:06,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138778166] [2025-01-09 05:45:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138778166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267778378] [2025-01-09 05:45:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:06,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:06,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:06,232 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:45:06,233 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:45:06,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:45:06,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:45:06,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:06,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:06,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:45:06,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:06,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:07,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267778378] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:07,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:07,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-01-09 05:45:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481781965] [2025-01-09 05:45:07,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:07,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 05:45:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:07,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 05:45:07,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-01-09 05:45:07,306 INFO L87 Difference]: Start difference. First operand 2938 states and 4454 transitions. Second operand has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:45:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:08,016 INFO L93 Difference]: Finished difference Result 4926 states and 7059 transitions. [2025-01-09 05:45:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 05:45:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 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 72 [2025-01-09 05:45:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:08,024 INFO L225 Difference]: With dead ends: 4926 [2025-01-09 05:45:08,024 INFO L226 Difference]: Without dead ends: 4286 [2025-01-09 05:45:08,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 05:45:08,026 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 12229 mSDsluCounter, 4662 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12229 SdHoareTripleChecker+Valid, 6158 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:08,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12229 Valid, 6158 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:45:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-01-09 05:45:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4134. [2025-01-09 05:45:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4134 states, 4132 states have (on average 1.4385285575992255) internal successors, (5944), 4133 states have internal predecessors, (5944), 0 states have call successors, (0), 0 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:45:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4134 states to 4134 states and 5944 transitions. [2025-01-09 05:45:08,086 INFO L78 Accepts]: Start accepts. Automaton has 4134 states and 5944 transitions. Word has length 72 [2025-01-09 05:45:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:08,087 INFO L471 AbstractCegarLoop]: Abstraction has 4134 states and 5944 transitions. [2025-01-09 05:45:08,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:45:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4134 states and 5944 transitions. [2025-01-09 05:45:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:45:08,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:08,088 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:45:08,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 05:45:08,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:08,289 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1074842387, now seen corresponding path program 1 times [2025-01-09 05:45:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319418780] [2025-01-09 05:45:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:08,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:08,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:08,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:08,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:08,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:09,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:09,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319418780] [2025-01-09 05:45:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319418780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:09,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486720406] [2025-01-09 05:45:09,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:09,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:09,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:09,189 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:45:09,190 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:45:09,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:09,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:09,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:09,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:09,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:45:09,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:09,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:10,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486720406] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:10,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:10,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:45:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990061281] [2025-01-09 05:45:10,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:10,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:45:10,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:10,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:45:10,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:45:10,242 INFO L87 Difference]: Start difference. First operand 4134 states and 5944 transitions. Second operand has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 0 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:45:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:11,475 INFO L93 Difference]: Finished difference Result 8477 states and 11576 transitions. [2025-01-09 05:45:11,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 05:45:11,476 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 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 73 [2025-01-09 05:45:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:11,488 INFO L225 Difference]: With dead ends: 8477 [2025-01-09 05:45:11,488 INFO L226 Difference]: Without dead ends: 6934 [2025-01-09 05:45:11,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=669, Invalid=2523, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 05:45:11,492 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 21595 mSDsluCounter, 6385 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21595 SdHoareTripleChecker+Valid, 7877 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:11,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21595 Valid, 7877 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:45:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6934 states. [2025-01-09 05:45:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6934 to 6892. [2025-01-09 05:45:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6892 states, 6890 states have (on average 1.3750362844702468) internal successors, (9474), 6891 states have internal predecessors, (9474), 0 states have call successors, (0), 0 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:45:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6892 states to 6892 states and 9474 transitions. [2025-01-09 05:45:11,595 INFO L78 Accepts]: Start accepts. Automaton has 6892 states and 9474 transitions. Word has length 73 [2025-01-09 05:45:11,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:11,597 INFO L471 AbstractCegarLoop]: Abstraction has 6892 states and 9474 transitions. [2025-01-09 05:45:11,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 0 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:45:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6892 states and 9474 transitions. [2025-01-09 05:45:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:45:11,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:11,598 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:45:11,604 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:45:11,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:11,802 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:11,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1730489837, now seen corresponding path program 1 times [2025-01-09 05:45:11,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:11,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705872913] [2025-01-09 05:45:11,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:11,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:11,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:11,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:11,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:12,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:12,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705872913] [2025-01-09 05:45:12,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705872913] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:12,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756889390] [2025-01-09 05:45:12,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:12,082 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:45:12,084 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:45:12,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:12,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:12,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:12,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:12,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:45:12,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:12,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756889390] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:13,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:45:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383610716] [2025-01-09 05:45:13,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:13,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:45:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:13,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:45:13,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:45:13,004 INFO L87 Difference]: Start difference. First operand 6892 states and 9474 transitions. Second operand has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:45:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:13,413 INFO L93 Difference]: Finished difference Result 15472 states and 20633 transitions. [2025-01-09 05:45:13,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:45:13,414 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 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 73 [2025-01-09 05:45:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:13,428 INFO L225 Difference]: With dead ends: 15472 [2025-01-09 05:45:13,428 INFO L226 Difference]: Without dead ends: 11470 [2025-01-09 05:45:13,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:45:13,436 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 15227 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15227 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:13,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15227 Valid, 6220 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:45:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2025-01-09 05:45:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 11354. [2025-01-09 05:45:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11354 states, 11352 states have (on average 1.3290169133192389) internal successors, (15087), 11353 states have internal predecessors, (15087), 0 states have call successors, (0), 0 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:45:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11354 states to 11354 states and 15087 transitions. [2025-01-09 05:45:13,631 INFO L78 Accepts]: Start accepts. Automaton has 11354 states and 15087 transitions. Word has length 73 [2025-01-09 05:45:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:13,631 INFO L471 AbstractCegarLoop]: Abstraction has 11354 states and 15087 transitions. [2025-01-09 05:45:13,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:45:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 11354 states and 15087 transitions. [2025-01-09 05:45:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 05:45:13,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:13,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:13,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:45:13,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:13,833 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:13,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash 376725732, now seen corresponding path program 1 times [2025-01-09 05:45:13,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:13,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295815095] [2025-01-09 05:45:13,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:13,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:45:13,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:45:13,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:13,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295815095] [2025-01-09 05:45:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295815095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141265665] [2025-01-09 05:45:14,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:14,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:14,055 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:45:14,057 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:45:14,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:45:14,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:45:14,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:14,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:14,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 05:45:14,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:14,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141265665] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:15,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-01-09 05:45:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637305400] [2025-01-09 05:45:15,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:15,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:45:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:15,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:45:15,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:45:15,145 INFO L87 Difference]: Start difference. First operand 11354 states and 15087 transitions. Second operand has 29 states, 29 states have (on average 6.551724137931035) internal successors, (190), 29 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:45:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:15,780 INFO L93 Difference]: Finished difference Result 19784 states and 26000 transitions. [2025-01-09 05:45:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 05:45:15,781 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.551724137931035) internal successors, (190), 29 states have internal predecessors, (190), 0 states have call successors, (0), 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 74 [2025-01-09 05:45:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:15,793 INFO L225 Difference]: With dead ends: 19784 [2025-01-09 05:45:15,793 INFO L226 Difference]: Without dead ends: 11678 [2025-01-09 05:45:15,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 05:45:15,798 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 16361 mSDsluCounter, 4932 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16361 SdHoareTripleChecker+Valid, 6445 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:15,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16361 Valid, 6445 Invalid, 551 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:45:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2025-01-09 05:45:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11198. [2025-01-09 05:45:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11198 states, 11196 states have (on average 1.3218113612004287) internal successors, (14799), 11197 states have internal predecessors, (14799), 0 states have call successors, (0), 0 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:45:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11198 states to 11198 states and 14799 transitions. [2025-01-09 05:45:16,142 INFO L78 Accepts]: Start accepts. Automaton has 11198 states and 14799 transitions. Word has length 74 [2025-01-09 05:45:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:16,142 INFO L471 AbstractCegarLoop]: Abstraction has 11198 states and 14799 transitions. [2025-01-09 05:45:16,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.551724137931035) internal successors, (190), 29 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:45:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 11198 states and 14799 transitions. [2025-01-09 05:45:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:45:16,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:16,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:16,150 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:45:16,344 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,SelfDestructingSolverStorable22 [2025-01-09 05:45:16,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:16,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash -368926045, now seen corresponding path program 1 times [2025-01-09 05:45:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:16,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434185346] [2025-01-09 05:45:16,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:16,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:16,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:16,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:16,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:17,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434185346] [2025-01-09 05:45:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434185346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886856920] [2025-01-09 05:45:17,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:17,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:17,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:17,012 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:45:17,014 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:45:17,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:17,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:17,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:17,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:17,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:45:17,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:17,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886856920] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:18,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-01-09 05:45:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269663054] [2025-01-09 05:45:18,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:18,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 05:45:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:18,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 05:45:18,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 05:45:18,566 INFO L87 Difference]: Start difference. First operand 11198 states and 14799 transitions. Second operand has 35 states, 35 states have (on average 5.9714285714285715) internal successors, (209), 35 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:45:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:24,756 INFO L93 Difference]: Finished difference Result 24178 states and 31667 transitions. [2025-01-09 05:45:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-01-09 05:45:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.9714285714285715) internal successors, (209), 35 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 75 [2025-01-09 05:45:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:24,775 INFO L225 Difference]: With dead ends: 24178 [2025-01-09 05:45:24,775 INFO L226 Difference]: Without dead ends: 19520 [2025-01-09 05:45:24,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4605 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2795, Invalid=11247, Unknown=0, NotChecked=0, Total=14042 [2025-01-09 05:45:24,783 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 15785 mSDsluCounter, 20210 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15785 SdHoareTripleChecker+Valid, 21751 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:24,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15785 Valid, 21751 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:45:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19520 states. [2025-01-09 05:45:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19520 to 9741. [2025-01-09 05:45:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9741 states, 9739 states have (on average 1.3316562275387618) internal successors, (12969), 9740 states have internal predecessors, (12969), 0 states have call successors, (0), 0 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:45:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9741 states to 9741 states and 12969 transitions. [2025-01-09 05:45:25,020 INFO L78 Accepts]: Start accepts. Automaton has 9741 states and 12969 transitions. Word has length 75 [2025-01-09 05:45:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:25,021 INFO L471 AbstractCegarLoop]: Abstraction has 9741 states and 12969 transitions. [2025-01-09 05:45:25,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.9714285714285715) internal successors, (209), 35 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:45:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 9741 states and 12969 transitions. [2025-01-09 05:45:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:45:25,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:25,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:25,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 05:45:25,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 05:45:25,222 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:25,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1647941027, now seen corresponding path program 1 times [2025-01-09 05:45:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347987783] [2025-01-09 05:45:25,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:25,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:25,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:25,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:25,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:25,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347987783] [2025-01-09 05:45:25,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347987783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:25,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012299786] [2025-01-09 05:45:25,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:25,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:25,775 INFO L229 MonitoredProcess]: Starting monitored process 7 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:45:25,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:45:25,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:25,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:25,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:25,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:25,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 05:45:25,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:28,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012299786] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:31,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:31,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27, 23] total 58 [2025-01-09 05:45:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020047764] [2025-01-09 05:45:31,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-01-09 05:45:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:31,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-01-09 05:45:31,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2857, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 05:45:31,567 INFO L87 Difference]: Start difference. First operand 9741 states and 12969 transitions. Second operand has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 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:45:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:45,138 INFO L93 Difference]: Finished difference Result 13402 states and 17648 transitions. [2025-01-09 05:45:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-01-09 05:45:45,138 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 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 75 [2025-01-09 05:45:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:45,146 INFO L225 Difference]: With dead ends: 13402 [2025-01-09 05:45:45,146 INFO L226 Difference]: Without dead ends: 8880 [2025-01-09 05:45:45,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5405 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3468, Invalid=16272, Unknown=0, NotChecked=0, Total=19740 [2025-01-09 05:45:45,152 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 21022 mSDsluCounter, 29112 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21022 SdHoareTripleChecker+Valid, 30639 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:45,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21022 Valid, 30639 Invalid, 2596 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [102 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 05:45:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8880 states. [2025-01-09 05:45:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8880 to 6617. [2025-01-09 05:45:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6617 states, 6615 states have (on average 1.3712773998488283) internal successors, (9071), 6616 states have internal predecessors, (9071), 0 states have call successors, (0), 0 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:45:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 9071 transitions. [2025-01-09 05:45:45,305 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 9071 transitions. Word has length 75 [2025-01-09 05:45:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:45,305 INFO L471 AbstractCegarLoop]: Abstraction has 6617 states and 9071 transitions. [2025-01-09 05:45:45,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 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:45:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 9071 transitions. [2025-01-09 05:45:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:45:45,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:45,306 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] [2025-01-09 05:45:45,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 05:45:45,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 05:45:45,510 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:45,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1441370690, now seen corresponding path program 1 times [2025-01-09 05:45:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:45,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714486560] [2025-01-09 05:45:45,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:45,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:45:45,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:45:45,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:45,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:46,790 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:45:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:46,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714486560] [2025-01-09 05:45:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714486560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:46,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622460419] [2025-01-09 05:45:46,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:46,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:46,792 INFO L229 MonitoredProcess]: Starting monitored process 8 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:45:46,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:45:46,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:45:46,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:45:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:46,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 05:45:46,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:48,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:50,554 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:45:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622460419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:50,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 20] total 59 [2025-01-09 05:45:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722531337] [2025-01-09 05:45:50,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:50,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-01-09 05:45:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:50,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-01-09 05:45:50,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3169, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 05:45:50,556 INFO L87 Difference]: Start difference. First operand 6617 states and 9071 transitions. Second operand has 59 states, 59 states have (on average 3.440677966101695) internal successors, (203), 59 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:46:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:02,555 INFO L93 Difference]: Finished difference Result 19439 states and 25787 transitions. [2025-01-09 05:46:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-01-09 05:46:02,556 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.440677966101695) internal successors, (203), 59 states have internal predecessors, (203), 0 states have call successors, (0), 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 76 [2025-01-09 05:46:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:02,571 INFO L225 Difference]: With dead ends: 19439 [2025-01-09 05:46:02,571 INFO L226 Difference]: Without dead ends: 16926 [2025-01-09 05:46:02,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5409 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=2817, Invalid=17775, Unknown=0, NotChecked=0, Total=20592 [2025-01-09 05:46:02,577 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 33250 mSDsluCounter, 26036 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33250 SdHoareTripleChecker+Valid, 27531 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:02,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33250 Valid, 27531 Invalid, 3442 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 05:46:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16926 states. [2025-01-09 05:46:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16926 to 6458. [2025-01-09 05:46:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 6456 states have (on average 1.3782527881040891) internal successors, (8898), 6457 states have internal predecessors, (8898), 0 states have call successors, (0), 0 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:46:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 8898 transitions. [2025-01-09 05:46:02,793 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 8898 transitions. Word has length 76 [2025-01-09 05:46:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:02,793 INFO L471 AbstractCegarLoop]: Abstraction has 6458 states and 8898 transitions. [2025-01-09 05:46:02,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.440677966101695) internal successors, (203), 59 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:46:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 8898 transitions. [2025-01-09 05:46:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 05:46:02,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:02,796 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-01-09 05:46:02,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 05:46:02,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:02,997 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:02,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -767481135, now seen corresponding path program 1 times [2025-01-09 05:46:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:02,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596097199] [2025-01-09 05:46:02,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:03,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:46:03,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:46:03,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:03,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 30 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596097199] [2025-01-09 05:46:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596097199] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761126807] [2025-01-09 05:46:03,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:03,492 INFO L229 MonitoredProcess]: Starting monitored process 9 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:46:03,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 05:46:03,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:46:03,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:46:03,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:03,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:03,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:46:03,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:04,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 38 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761126807] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:06,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-01-09 05:46:06,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236347151] [2025-01-09 05:46:06,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:06,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 05:46:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:06,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 05:46:06,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 05:46:06,268 INFO L87 Difference]: Start difference. First operand 6458 states and 8898 transitions. Second operand has 35 states, 35 states have (on average 9.228571428571428) internal successors, (323), 35 states have internal predecessors, (323), 0 states have call successors, (0), 0 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:46:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:10,194 INFO L93 Difference]: Finished difference Result 17204 states and 22805 transitions. [2025-01-09 05:46:10,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 05:46:10,194 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 9.228571428571428) internal successors, (323), 35 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 05:46:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:10,207 INFO L225 Difference]: With dead ends: 17204 [2025-01-09 05:46:10,207 INFO L226 Difference]: Without dead ends: 13294 [2025-01-09 05:46:10,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1536, Invalid=6654, Unknown=0, NotChecked=0, Total=8190 [2025-01-09 05:46:10,213 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 25691 mSDsluCounter, 11691 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25691 SdHoareTripleChecker+Valid, 13250 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:10,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25691 Valid, 13250 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:46:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13294 states. [2025-01-09 05:46:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13294 to 11050. [2025-01-09 05:46:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11050 states, 11048 states have (on average 1.3175235336712527) internal successors, (14556), 11049 states have internal predecessors, (14556), 0 states have call successors, (0), 0 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:46:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 14556 transitions. [2025-01-09 05:46:10,647 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 14556 transitions. Word has length 119 [2025-01-09 05:46:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:10,647 INFO L471 AbstractCegarLoop]: Abstraction has 11050 states and 14556 transitions. [2025-01-09 05:46:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.228571428571428) internal successors, (323), 35 states have internal predecessors, (323), 0 states have call successors, (0), 0 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:46:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 14556 transitions. [2025-01-09 05:46:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 05:46:10,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:10,650 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2025-01-09 05:46:10,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 05:46:10,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 05:46:10,851 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:10,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash 115812994, now seen corresponding path program 1 times [2025-01-09 05:46:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:10,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15177939] [2025-01-09 05:46:10,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:10,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 05:46:10,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 05:46:10,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:10,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15177939] [2025-01-09 05:46:11,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15177939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983181205] [2025-01-09 05:46:11,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:11,482 INFO L229 MonitoredProcess]: Starting monitored process 10 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:46:11,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 05:46:11,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 05:46:11,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 05:46:11,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:11,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:46:11,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 41 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:12,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983181205] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:13,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:13,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 35 [2025-01-09 05:46:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300548141] [2025-01-09 05:46:13,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:13,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 05:46:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:13,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 05:46:13,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 05:46:13,384 INFO L87 Difference]: Start difference. First operand 11050 states and 14556 transitions. Second operand has 36 states, 36 states have (on average 8.88888888888889) internal successors, (320), 35 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)