./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.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 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:39:40,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:39:40,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:39:40,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:39:40,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:39:40,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:39:40,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:39:40,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:39:40,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:39:40,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:39:40,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:39:40,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:39:40,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:39:40,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:39:40,361 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:39:40,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:39:40,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:39:40,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:40,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:40,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:39:40,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:39:40,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:39:40,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:39:40,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:39:40,364 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 -> 0ed6e4196d49d75b29a7ddd297e9986c08c6bd65f18221f72f78571f381f483e [2025-01-09 04:39:40,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:39:40,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:39:40,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:39:40,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:39:40,560 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:39:40,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-01-09 04:39:41,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/badcc7555/f2cf1897b9b34f9db6e5f0903ecdd50b/FLAGc43e6656c [2025-01-09 04:39:42,072 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:39:42,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-01-09 04:39:42,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/badcc7555/f2cf1897b9b34f9db6e5f0903ecdd50b/FLAGc43e6656c [2025-01-09 04:39:42,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/badcc7555/f2cf1897b9b34f9db6e5f0903ecdd50b [2025-01-09 04:39:42,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:39:42,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:39:42,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:39:42,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:39:42,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:39:42,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:42,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31432bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42, skipping insertion in model container [2025-01-09 04:39:42,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:42,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:39:42,464 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2025-01-09 04:39:42,501 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2025-01-09 04:39:42,508 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2025-01-09 04:39:42,512 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2025-01-09 04:39:42,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:39:42,660 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:39:42,700 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[8637,8650] [2025-01-09 04:39:42,724 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15862,15875] [2025-01-09 04:39:42,729 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18059,18072] [2025-01-09 04:39:42,731 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[19083,19096] [2025-01-09 04:39:42,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:39:42,844 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:39:42,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42 WrapperNode [2025-01-09 04:39:42,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:39:42,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:39:42,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:39:42,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:39:42,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:42,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:42,944 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2847 [2025-01-09 04:39:42,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:39:42,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:39:42,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:39:42,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:39:42,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:42,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:42,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,011 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 04:39:43,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:39:43,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:39:43,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:39:43,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:39:43,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (1/1) ... [2025-01-09 04:39:43,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:39:43,148 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 04:39:43,152 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 04:39:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:39:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:39:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:39:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:39:43,342 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:39:43,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:39:44,629 INFO L? ?]: Removed 486 outVars from TransFormulas that were not future-live. [2025-01-09 04:39:44,629 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:39:44,650 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:39:44,654 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:39:44,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:44 BoogieIcfgContainer [2025-01-09 04:39:44,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:39:44,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:39:44,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:39:44,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:39:44,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:39:42" (1/3) ... [2025-01-09 04:39:44,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602f8de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:44, skipping insertion in model container [2025-01-09 04:39:44,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:42" (2/3) ... [2025-01-09 04:39:44,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602f8de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:44, skipping insertion in model container [2025-01-09 04:39:44,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:44" (3/3) ... [2025-01-09 04:39:44,664 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2025-01-09 04:39:44,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:39:44,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c that has 1 procedures, 457 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-09 04:39:44,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:39:44,783 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;@7c606041, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:39:44,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 04:39:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 0 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 04:39:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:39:44,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:44,795 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] [2025-01-09 04:39:44,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:44,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1707798208, now seen corresponding path program 1 times [2025-01-09 04:39:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734295960] [2025-01-09 04:39:44,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:44,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:44,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:39:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:39:44,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:44,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:45,144 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 04:39:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:45,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734295960] [2025-01-09 04:39:45,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734295960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:45,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:45,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:45,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205431106] [2025-01-09 04:39:45,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:45,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:45,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:45,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:45,171 INFO L87 Difference]: Start difference. First operand has 457 states, 452 states have (on average 1.8495575221238938) internal successors, (836), 456 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:39:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:45,275 INFO L93 Difference]: Finished difference Result 725 states and 1271 transitions. [2025-01-09 04:39:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:45,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 04:39:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:45,289 INFO L225 Difference]: With dead ends: 725 [2025-01-09 04:39:45,291 INFO L226 Difference]: Without dead ends: 571 [2025-01-09 04:39:45,294 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 04:39:45,301 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 438 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:45,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-01-09 04:39:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 565. [2025-01-09 04:39:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 561 states have (on average 1.3440285204991087) internal successors, (754), 564 states have internal predecessors, (754), 0 states have call successors, (0), 0 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 04:39:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 754 transitions. [2025-01-09 04:39:45,369 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 754 transitions. Word has length 51 [2025-01-09 04:39:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:45,370 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 754 transitions. [2025-01-09 04:39:45,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:39:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 754 transitions. [2025-01-09 04:39:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:39:45,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:45,376 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] [2025-01-09 04:39:45,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:39:45,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1349444518, now seen corresponding path program 1 times [2025-01-09 04:39:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734932239] [2025-01-09 04:39:45,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:45,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:39:45,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:39:45,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:45,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:45,535 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 04:39:45,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:45,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734932239] [2025-01-09 04:39:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734932239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:45,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:45,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009960060] [2025-01-09 04:39:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:45,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:45,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:45,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:45,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:45,540 INFO L87 Difference]: Start difference. First operand 565 states and 754 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:39:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:45,611 INFO L93 Difference]: Finished difference Result 994 states and 1379 transitions. [2025-01-09 04:39:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:45,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 04:39:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:45,615 INFO L225 Difference]: With dead ends: 994 [2025-01-09 04:39:45,617 INFO L226 Difference]: Without dead ends: 781 [2025-01-09 04:39:45,618 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 04:39:45,619 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 314 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:45,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1017 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:39:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-01-09 04:39:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 774. [2025-01-09 04:39:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 770 states have (on average 1.3714285714285714) internal successors, (1056), 773 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 04:39:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1056 transitions. [2025-01-09 04:39:45,659 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1056 transitions. Word has length 51 [2025-01-09 04:39:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:45,661 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1056 transitions. [2025-01-09 04:39:45,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:39:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1056 transitions. [2025-01-09 04:39:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:39:45,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:45,663 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] [2025-01-09 04:39:45,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:39:45,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:45,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1493728400, now seen corresponding path program 1 times [2025-01-09 04:39:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:45,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643502995] [2025-01-09 04:39:45,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:45,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:39:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:39:45,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:45,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:45,849 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 04:39:45,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643502995] [2025-01-09 04:39:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643502995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:39:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793518028] [2025-01-09 04:39:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:45,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:39:45,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:45,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:39:45,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:39:45,854 INFO L87 Difference]: Start difference. First operand 774 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:39:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:46,160 INFO L93 Difference]: Finished difference Result 1720 states and 2419 transitions. [2025-01-09 04:39:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:39:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-09 04:39:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:46,165 INFO L225 Difference]: With dead ends: 1720 [2025-01-09 04:39:46,165 INFO L226 Difference]: Without dead ends: 1063 [2025-01-09 04:39:46,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:39:46,169 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1742 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:46,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 392 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:39:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-01-09 04:39:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1057. [2025-01-09 04:39:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1053 states have (on average 1.4074074074074074) internal successors, (1482), 1056 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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 04:39:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1482 transitions. [2025-01-09 04:39:46,194 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1482 transitions. Word has length 51 [2025-01-09 04:39:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:46,196 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1482 transitions. [2025-01-09 04:39:46,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:39:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1482 transitions. [2025-01-09 04:39:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:39:46,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:46,198 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] [2025-01-09 04:39:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:39:46,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:46,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -358090099, now seen corresponding path program 1 times [2025-01-09 04:39:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053584748] [2025-01-09 04:39:46,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:46,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:39:46,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:39:46,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:46,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:46,358 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 04:39:46,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:46,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053584748] [2025-01-09 04:39:46,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053584748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:46,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647266813] [2025-01-09 04:39:46,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:46,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:46,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:46,360 INFO L87 Difference]: Start difference. First operand 1057 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 04:39:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:46,394 INFO L93 Difference]: Finished difference Result 2561 states and 3637 transitions. [2025-01-09 04:39:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-01-09 04:39:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:46,401 INFO L225 Difference]: With dead ends: 2561 [2025-01-09 04:39:46,401 INFO L226 Difference]: Without dead ends: 1730 [2025-01-09 04:39:46,403 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 04:39:46,403 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 364 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:46,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 933 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-01-09 04:39:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1716. [2025-01-09 04:39:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1712 states have (on average 1.3919392523364487) internal successors, (2383), 1715 states have internal predecessors, (2383), 0 states have call successors, (0), 0 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 04:39:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2383 transitions. [2025-01-09 04:39:46,438 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2383 transitions. Word has length 52 [2025-01-09 04:39:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:46,438 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2383 transitions. [2025-01-09 04:39:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 04:39:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2383 transitions. [2025-01-09 04:39:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:39:46,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:46,441 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] [2025-01-09 04:39:46,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:39:46,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1296606516, now seen corresponding path program 1 times [2025-01-09 04:39:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374545263] [2025-01-09 04:39:46,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:46,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:39:46,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:39:46,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:46,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:46,550 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 04:39:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374545263] [2025-01-09 04:39:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374545263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:39:46,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561506031] [2025-01-09 04:39:46,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:39:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:46,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:39:46,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:39:46,552 INFO L87 Difference]: Start difference. First operand 1716 states and 2383 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 04:39:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:46,848 INFO L93 Difference]: Finished difference Result 3785 states and 5312 transitions. [2025-01-09 04:39:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:39:46,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-01-09 04:39:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:46,855 INFO L225 Difference]: With dead ends: 3785 [2025-01-09 04:39:46,855 INFO L226 Difference]: Without dead ends: 2241 [2025-01-09 04:39:46,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:39:46,857 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1537 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:46,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 367 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:39:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2025-01-09 04:39:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2227. [2025-01-09 04:39:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2223 states have (on average 1.3967611336032388) internal successors, (3105), 2226 states have internal predecessors, (3105), 0 states have call successors, (0), 0 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 04:39:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3105 transitions. [2025-01-09 04:39:46,895 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3105 transitions. Word has length 52 [2025-01-09 04:39:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:46,895 INFO L471 AbstractCegarLoop]: Abstraction has 2227 states and 3105 transitions. [2025-01-09 04:39:46,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 04:39:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3105 transitions. [2025-01-09 04:39:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:39:46,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:46,897 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] [2025-01-09 04:39:46,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:39:46,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:46,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash -482685133, now seen corresponding path program 1 times [2025-01-09 04:39:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784961884] [2025-01-09 04:39:46,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:46,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:39:46,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:39:46,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:46,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:47,056 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 04:39:47,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:47,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784961884] [2025-01-09 04:39:47,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784961884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:47,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:47,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:39:47,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047369749] [2025-01-09 04:39:47,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:47,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:39:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:47,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:39:47,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:39:47,057 INFO L87 Difference]: Start difference. First operand 2227 states and 3105 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:39:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:47,296 INFO L93 Difference]: Finished difference Result 5040 states and 7066 transitions. [2025-01-09 04:39:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:39:47,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-01-09 04:39:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:47,307 INFO L225 Difference]: With dead ends: 5040 [2025-01-09 04:39:47,307 INFO L226 Difference]: Without dead ends: 2985 [2025-01-09 04:39:47,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:39:47,314 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1386 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:47,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 335 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:39:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2025-01-09 04:39:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2966. [2025-01-09 04:39:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2962 states have (on average 1.3902768399729912) internal successors, (4118), 2965 states have internal predecessors, (4118), 0 states have call successors, (0), 0 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 04:39:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4118 transitions. [2025-01-09 04:39:47,378 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4118 transitions. Word has length 53 [2025-01-09 04:39:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:47,378 INFO L471 AbstractCegarLoop]: Abstraction has 2966 states and 4118 transitions. [2025-01-09 04:39:47,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:39:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4118 transitions. [2025-01-09 04:39:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:39:47,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:47,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:47,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:39:47,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:47,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1630046103, now seen corresponding path program 1 times [2025-01-09 04:39:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:47,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110781362] [2025-01-09 04:39:47,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:47,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:39:47,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:39:47,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:47,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:47,587 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 04:39:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110781362] [2025-01-09 04:39:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110781362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:39:47,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504380415] [2025-01-09 04:39:47,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:47,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:39:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:47,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:39:47,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:39:47,589 INFO L87 Difference]: Start difference. First operand 2966 states and 4118 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:47,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:47,906 INFO L93 Difference]: Finished difference Result 5867 states and 8228 transitions. [2025-01-09 04:39:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:39:47,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:39:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:47,919 INFO L225 Difference]: With dead ends: 5867 [2025-01-09 04:39:47,919 INFO L226 Difference]: Without dead ends: 4546 [2025-01-09 04:39:47,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:39:47,921 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1715 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:47,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 583 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:39:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2025-01-09 04:39:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2980. [2025-01-09 04:39:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2976 states have (on average 1.3897849462365592) internal successors, (4136), 2979 states have internal predecessors, (4136), 0 states have call successors, (0), 0 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 04:39:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4136 transitions. [2025-01-09 04:39:47,987 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4136 transitions. Word has length 54 [2025-01-09 04:39:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:47,987 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4136 transitions. [2025-01-09 04:39:47,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4136 transitions. [2025-01-09 04:39:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:39:47,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:47,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:47,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:39:47,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:47,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1470909546, now seen corresponding path program 1 times [2025-01-09 04:39:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:47,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685135460] [2025-01-09 04:39:47,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:48,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:39:48,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:39:48,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:48,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:48,150 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 04:39:48,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:48,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685135460] [2025-01-09 04:39:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685135460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:39:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689949250] [2025-01-09 04:39:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:48,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:39:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:39:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:39:48,153 INFO L87 Difference]: Start difference. First operand 2980 states and 4136 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:48,496 INFO L93 Difference]: Finished difference Result 6538 states and 9201 transitions. [2025-01-09 04:39:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:39:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:39:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:48,511 INFO L225 Difference]: With dead ends: 6538 [2025-01-09 04:39:48,511 INFO L226 Difference]: Without dead ends: 5420 [2025-01-09 04:39:48,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:39:48,515 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1840 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:48,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 618 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:39:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2025-01-09 04:39:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 3002. [2025-01-09 04:39:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2998 states have (on average 1.3899266177451635) internal successors, (4167), 3001 states have internal predecessors, (4167), 0 states have call successors, (0), 0 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 04:39:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 4167 transitions. [2025-01-09 04:39:48,593 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 4167 transitions. Word has length 54 [2025-01-09 04:39:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:48,593 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 4167 transitions. [2025-01-09 04:39:48,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4167 transitions. [2025-01-09 04:39:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:39:48,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:48,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:39:48,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:48,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash 269556297, now seen corresponding path program 1 times [2025-01-09 04:39:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042476574] [2025-01-09 04:39:48,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:48,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:39:48,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:39:48,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:48,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:48,741 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 04:39:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042476574] [2025-01-09 04:39:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042476574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:39:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23207816] [2025-01-09 04:39:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:48,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:39:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:48,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:39:48,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:39:48,742 INFO L87 Difference]: Start difference. First operand 3002 states and 4167 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:49,102 INFO L93 Difference]: Finished difference Result 7320 states and 10266 transitions. [2025-01-09 04:39:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:39:49,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:39:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:49,118 INFO L225 Difference]: With dead ends: 7320 [2025-01-09 04:39:49,118 INFO L226 Difference]: Without dead ends: 6352 [2025-01-09 04:39:49,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:39:49,123 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1962 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:49,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 632 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:39:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2025-01-09 04:39:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 3036. [2025-01-09 04:39:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3032 states have (on average 1.3888522427440633) internal successors, (4211), 3035 states have internal predecessors, (4211), 0 states have call successors, (0), 0 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 04:39:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4211 transitions. [2025-01-09 04:39:49,187 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4211 transitions. Word has length 54 [2025-01-09 04:39:49,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:49,188 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 4211 transitions. [2025-01-09 04:39:49,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4211 transitions. [2025-01-09 04:39:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:39:49,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:49,190 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] [2025-01-09 04:39:49,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:39:49,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:49,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1866987345, now seen corresponding path program 1 times [2025-01-09 04:39:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893794414] [2025-01-09 04:39:49,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:49,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:39:49,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:39:49,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:49,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:39:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893794414] [2025-01-09 04:39:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893794414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:39:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259207843] [2025-01-09 04:39:49,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:49,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:39:49,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:49,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:39:49,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:39:49,459 INFO L87 Difference]: Start difference. First operand 3036 states and 4211 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:39:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:49,919 INFO L93 Difference]: Finished difference Result 6220 states and 8782 transitions. [2025-01-09 04:39:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:39:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:39:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:49,926 INFO L225 Difference]: With dead ends: 6220 [2025-01-09 04:39:49,926 INFO L226 Difference]: Without dead ends: 4259 [2025-01-09 04:39:49,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:39:49,929 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1980 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:49,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 765 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:39:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-01-09 04:39:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 2949. [2025-01-09 04:39:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2945 states have (on average 1.3884550084889644) internal successors, (4089), 2948 states have internal predecessors, (4089), 0 states have call successors, (0), 0 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 04:39:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4089 transitions. [2025-01-09 04:39:49,964 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4089 transitions. Word has length 55 [2025-01-09 04:39:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:49,964 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4089 transitions. [2025-01-09 04:39:49,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:39:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4089 transitions. [2025-01-09 04:39:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:39:49,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:49,966 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] [2025-01-09 04:39:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:39:49,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:49,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:49,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1508633655, now seen corresponding path program 1 times [2025-01-09 04:39:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119911812] [2025-01-09 04:39:49,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:49,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:39:49,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:39:49,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:49,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:39:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:50,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119911812] [2025-01-09 04:39:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119911812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:50,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:50,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:39:50,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017483836] [2025-01-09 04:39:50,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:50,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:39:50,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:50,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:39:50,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:39:50,209 INFO L87 Difference]: Start difference. First operand 2949 states and 4089 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:39:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:50,740 INFO L93 Difference]: Finished difference Result 5928 states and 8313 transitions. [2025-01-09 04:39:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:39:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:39:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:50,752 INFO L225 Difference]: With dead ends: 5928 [2025-01-09 04:39:50,752 INFO L226 Difference]: Without dead ends: 4121 [2025-01-09 04:39:50,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:39:50,757 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1694 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:50,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 1195 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:39:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2025-01-09 04:39:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 2920. [2025-01-09 04:39:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.3882030178326474) internal successors, (4048), 2919 states have internal predecessors, (4048), 0 states have call successors, (0), 0 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 04:39:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4048 transitions. [2025-01-09 04:39:50,798 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4048 transitions. Word has length 55 [2025-01-09 04:39:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:50,798 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4048 transitions. [2025-01-09 04:39:50,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:39:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4048 transitions. [2025-01-09 04:39:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:39:50,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:50,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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:50,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:39:50,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:50,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1235712110, now seen corresponding path program 1 times [2025-01-09 04:39:50,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:50,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346674771] [2025-01-09 04:39:50,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:50,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:50,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:39:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:39:50,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:50,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:51,077 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 04:39:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346674771] [2025-01-09 04:39:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346674771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:39:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048928966] [2025-01-09 04:39:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:51,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:39:51,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:51,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:39:51,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:39:51,079 INFO L87 Difference]: Start difference. First operand 2920 states and 4048 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:39:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:51,662 INFO L93 Difference]: Finished difference Result 4382 states and 6098 transitions. [2025-01-09 04:39:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:39:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 04:39:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:51,674 INFO L225 Difference]: With dead ends: 4382 [2025-01-09 04:39:51,674 INFO L226 Difference]: Without dead ends: 4377 [2025-01-09 04:39:51,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:39:51,676 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2051 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:51,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 1069 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:39:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2025-01-09 04:39:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 2920. [2025-01-09 04:39:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.387517146776406) internal successors, (4046), 2919 states have internal predecessors, (4046), 0 states have call successors, (0), 0 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 04:39:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4046 transitions. [2025-01-09 04:39:51,765 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4046 transitions. Word has length 55 [2025-01-09 04:39:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:51,765 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4046 transitions. [2025-01-09 04:39:51,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:39:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4046 transitions. [2025-01-09 04:39:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:39:51,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:51,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:51,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:39:51,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:51,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1411677613, now seen corresponding path program 1 times [2025-01-09 04:39:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:51,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910140382] [2025-01-09 04:39:51,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:51,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:51,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:39:51,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:39:51,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:51,823 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 04:39:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910140382] [2025-01-09 04:39:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910140382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:51,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:51,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227812264] [2025-01-09 04:39:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:51,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:51,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:51,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:51,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:51,825 INFO L87 Difference]: Start difference. First operand 2920 states and 4046 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:51,865 INFO L93 Difference]: Finished difference Result 4193 states and 5857 transitions. [2025-01-09 04:39:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-01-09 04:39:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:51,870 INFO L225 Difference]: With dead ends: 4193 [2025-01-09 04:39:51,870 INFO L226 Difference]: Without dead ends: 2927 [2025-01-09 04:39:51,872 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 04:39:51,872 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 224 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:51,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 797 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2025-01-09 04:39:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2920. [2025-01-09 04:39:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.3737997256515775) internal successors, (4006), 2919 states have internal predecessors, (4006), 0 states have call successors, (0), 0 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 04:39:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4006 transitions. [2025-01-09 04:39:51,911 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4006 transitions. Word has length 56 [2025-01-09 04:39:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:51,911 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4006 transitions. [2025-01-09 04:39:51,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4006 transitions. [2025-01-09 04:39:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:39:51,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:51,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:39:51,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:51,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1038080617, now seen corresponding path program 1 times [2025-01-09 04:39:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930901807] [2025-01-09 04:39:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:51,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:39:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:39:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:51,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:51,966 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 04:39:51,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:51,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930901807] [2025-01-09 04:39:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930901807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:51,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:51,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:51,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067006576] [2025-01-09 04:39:51,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:51,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:51,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:51,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:51,968 INFO L87 Difference]: Start difference. First operand 2920 states and 4006 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:51,993 INFO L93 Difference]: Finished difference Result 4260 states and 5889 transitions. [2025-01-09 04:39:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-01-09 04:39:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:51,998 INFO L225 Difference]: With dead ends: 4260 [2025-01-09 04:39:51,998 INFO L226 Difference]: Without dead ends: 2926 [2025-01-09 04:39:51,999 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 04:39:52,000 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 240 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:52,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 802 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2025-01-09 04:39:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2920. [2025-01-09 04:39:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2916 states have (on average 1.3614540466392318) internal successors, (3970), 2919 states have internal predecessors, (3970), 0 states have call successors, (0), 0 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 04:39:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 3970 transitions. [2025-01-09 04:39:52,030 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 3970 transitions. Word has length 56 [2025-01-09 04:39:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:52,030 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 3970 transitions. [2025-01-09 04:39:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3970 transitions. [2025-01-09 04:39:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:39:52,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:52,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:52,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:39:52,032 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1735355720, now seen corresponding path program 1 times [2025-01-09 04:39:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:52,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526046053] [2025-01-09 04:39:52,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:52,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:39:52,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:39:52,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:52,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:52,078 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 04:39:52,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:52,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526046053] [2025-01-09 04:39:52,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526046053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:52,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:52,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:52,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291800348] [2025-01-09 04:39:52,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:52,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:52,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:52,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:52,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:52,079 INFO L87 Difference]: Start difference. First operand 2920 states and 3970 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:52,104 INFO L93 Difference]: Finished difference Result 4010 states and 5458 transitions. [2025-01-09 04:39:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:52,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-01-09 04:39:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:52,108 INFO L225 Difference]: With dead ends: 4010 [2025-01-09 04:39:52,109 INFO L226 Difference]: Without dead ends: 2911 [2025-01-09 04:39:52,110 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 04:39:52,110 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 259 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:52,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 813 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-01-09 04:39:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2905. [2025-01-09 04:39:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2901 states have (on average 1.3340227507755946) internal successors, (3870), 2904 states have internal predecessors, (3870), 0 states have call successors, (0), 0 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 04:39:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 3870 transitions. [2025-01-09 04:39:52,139 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 3870 transitions. Word has length 56 [2025-01-09 04:39:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:52,139 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 3870 transitions. [2025-01-09 04:39:52,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3870 transitions. [2025-01-09 04:39:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:39:52,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:52,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:52,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:39:52,142 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:52,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1293695138, now seen corresponding path program 1 times [2025-01-09 04:39:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:52,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012756632] [2025-01-09 04:39:52,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:52,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:39:52,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:39:52,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:52,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:52,179 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 04:39:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012756632] [2025-01-09 04:39:52,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012756632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:52,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:52,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:52,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172095846] [2025-01-09 04:39:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:52,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:52,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:52,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:52,181 INFO L87 Difference]: Start difference. First operand 2905 states and 3870 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:52,233 INFO L93 Difference]: Finished difference Result 4583 states and 6152 transitions. [2025-01-09 04:39:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:52,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 04:39:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:52,238 INFO L225 Difference]: With dead ends: 4583 [2025-01-09 04:39:52,238 INFO L226 Difference]: Without dead ends: 3323 [2025-01-09 04:39:52,240 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 04:39:52,240 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 324 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:52,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 532 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2025-01-09 04:39:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2723. [2025-01-09 04:39:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2719 states have (on average 1.3365207796984184) internal successors, (3634), 2722 states have internal predecessors, (3634), 0 states have call successors, (0), 0 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 04:39:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3634 transitions. [2025-01-09 04:39:52,290 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3634 transitions. Word has length 57 [2025-01-09 04:39:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:52,290 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3634 transitions. [2025-01-09 04:39:52,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3634 transitions. [2025-01-09 04:39:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:39:52,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:52,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:52,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:39:52,292 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:52,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1073895861, now seen corresponding path program 1 times [2025-01-09 04:39:52,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:52,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939495836] [2025-01-09 04:39:52,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:52,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:39:52,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:39:52,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:52,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:53,011 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 04:39:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939495836] [2025-01-09 04:39:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939495836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:39:53,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372034900] [2025-01-09 04:39:53,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:53,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:39:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:53,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:39:53,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:39:53,013 INFO L87 Difference]: Start difference. First operand 2723 states and 3634 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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 04:39:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:53,601 INFO L93 Difference]: Finished difference Result 3931 states and 5290 transitions. [2025-01-09 04:39:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:39:53,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 04:39:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:53,609 INFO L225 Difference]: With dead ends: 3931 [2025-01-09 04:39:53,609 INFO L226 Difference]: Without dead ends: 3517 [2025-01-09 04:39:53,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:39:53,610 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 2064 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:53,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 2218 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:39:53,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2025-01-09 04:39:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 2677. [2025-01-09 04:39:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2674 states have (on average 1.337696335078534) internal successors, (3577), 2676 states have internal predecessors, (3577), 0 states have call successors, (0), 0 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 04:39:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3577 transitions. [2025-01-09 04:39:53,631 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3577 transitions. Word has length 58 [2025-01-09 04:39:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:53,631 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 3577 transitions. [2025-01-09 04:39:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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 04:39:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3577 transitions. [2025-01-09 04:39:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:39:53,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:53,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:53,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:39:53,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:53,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1243428052, now seen corresponding path program 1 times [2025-01-09 04:39:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26268757] [2025-01-09 04:39:53,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:39:53,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:39:53,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:53,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:54,422 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 04:39:54,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26268757] [2025-01-09 04:39:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26268757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 04:39:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982079793] [2025-01-09 04:39:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:54,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:39:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:39:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:39:54,423 INFO L87 Difference]: Start difference. First operand 2677 states and 3577 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 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 04:39:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:56,237 INFO L93 Difference]: Finished difference Result 4073 states and 5463 transitions. [2025-01-09 04:39:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:39:56,237 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 04:39:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:56,243 INFO L225 Difference]: With dead ends: 4073 [2025-01-09 04:39:56,243 INFO L226 Difference]: Without dead ends: 4067 [2025-01-09 04:39:56,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:39:56,245 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 2304 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2304 SdHoareTripleChecker+Valid, 4075 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:56,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2304 Valid, 4075 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:39:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2025-01-09 04:39:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 2677. [2025-01-09 04:39:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2674 states have (on average 1.337322363500374) internal successors, (3576), 2676 states have internal predecessors, (3576), 0 states have call successors, (0), 0 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 04:39:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3576 transitions. [2025-01-09 04:39:56,283 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3576 transitions. Word has length 58 [2025-01-09 04:39:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:56,283 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 3576 transitions. [2025-01-09 04:39:56,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 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 04:39:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3576 transitions. [2025-01-09 04:39:56,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:39:56,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:56,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:56,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:39:56,285 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:56,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:56,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1776503256, now seen corresponding path program 1 times [2025-01-09 04:39:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733201055] [2025-01-09 04:39:56,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:56,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:39:56,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:39:56,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:56,852 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 04:39:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:56,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733201055] [2025-01-09 04:39:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733201055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:56,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:39:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119851530] [2025-01-09 04:39:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:56,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:39:56,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:56,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:39:56,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:39:56,853 INFO L87 Difference]: Start difference. First operand 2677 states and 3576 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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 04:39:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:57,897 INFO L93 Difference]: Finished difference Result 3613 states and 4850 transitions. [2025-01-09 04:39:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:39:57,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 04:39:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:57,903 INFO L225 Difference]: With dead ends: 3613 [2025-01-09 04:39:57,903 INFO L226 Difference]: Without dead ends: 3502 [2025-01-09 04:39:57,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:39:57,905 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 1988 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:57,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 2128 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:39:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2025-01-09 04:39:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2662. [2025-01-09 04:39:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2660 states have (on average 1.33796992481203) internal successors, (3559), 2661 states have internal predecessors, (3559), 0 states have call successors, (0), 0 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 04:39:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3559 transitions. [2025-01-09 04:39:57,933 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3559 transitions. Word has length 58 [2025-01-09 04:39:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:57,933 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3559 transitions. [2025-01-09 04:39:57,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 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 04:39:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3559 transitions. [2025-01-09 04:39:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:39:57,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:57,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:57,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:39:57,935 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:57,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1779959307, now seen corresponding path program 1 times [2025-01-09 04:39:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:57,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8882085] [2025-01-09 04:39:57,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:39:57,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:39:57,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:57,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:58,279 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 04:39:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8882085] [2025-01-09 04:39:58,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8882085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:58,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:39:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840917061] [2025-01-09 04:39:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:58,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:39:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:58,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:39:58,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:39:58,282 INFO L87 Difference]: Start difference. First operand 2662 states and 3559 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 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 04:39:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:58,862 INFO L93 Difference]: Finished difference Result 4792 states and 6478 transitions. [2025-01-09 04:39:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:39:58,862 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-01-09 04:39:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:58,869 INFO L225 Difference]: With dead ends: 4792 [2025-01-09 04:39:58,869 INFO L226 Difference]: Without dead ends: 4436 [2025-01-09 04:39:58,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:39:58,872 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 2410 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:58,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 1621 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:39:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2025-01-09 04:39:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 2611. [2025-01-09 04:39:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2610 states have (on average 1.3398467432950192) internal successors, (3497), 2610 states have internal predecessors, (3497), 0 states have call successors, (0), 0 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 04:39:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3497 transitions. [2025-01-09 04:39:58,928 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3497 transitions. Word has length 58 [2025-01-09 04:39:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:58,928 INFO L471 AbstractCegarLoop]: Abstraction has 2611 states and 3497 transitions. [2025-01-09 04:39:58,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 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 04:39:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3497 transitions. [2025-01-09 04:39:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:39:58,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:58,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:58,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:39:58,931 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:58,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash 590074057, now seen corresponding path program 1 times [2025-01-09 04:39:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:58,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015396606] [2025-01-09 04:39:58,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:58,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:58,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:39:58,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:39:58,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:58,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:58,998 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 04:39:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015396606] [2025-01-09 04:39:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015396606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:39:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174645630] [2025-01-09 04:39:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:39:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:59,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:39:59,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:39:59,001 INFO L87 Difference]: Start difference. First operand 2611 states and 3497 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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 04:39:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:59,073 INFO L93 Difference]: Finished difference Result 6274 states and 8641 transitions. [2025-01-09 04:39:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:39:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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 04:39:59,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:59,079 INFO L225 Difference]: With dead ends: 6274 [2025-01-09 04:39:59,080 INFO L226 Difference]: Without dead ends: 4715 [2025-01-09 04:39:59,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:39:59,082 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 1197 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:59,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 881 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2025-01-09 04:39:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4058. [2025-01-09 04:39:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4058 states, 4057 states have (on average 1.3433571604633967) internal successors, (5450), 4057 states have internal predecessors, (5450), 0 states have call successors, (0), 0 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 04:39:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 5450 transitions. [2025-01-09 04:39:59,120 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 5450 transitions. Word has length 68 [2025-01-09 04:39:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:59,120 INFO L471 AbstractCegarLoop]: Abstraction has 4058 states and 5450 transitions. [2025-01-09 04:39:59,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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 04:39:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 5450 transitions. [2025-01-09 04:39:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:39:59,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:59,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:59,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:39:59,124 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:59,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1666510355, now seen corresponding path program 1 times [2025-01-09 04:39:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:59,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229631714] [2025-01-09 04:39:59,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:59,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:59,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:39:59,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:39:59,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:59,194 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 04:39:59,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:59,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229631714] [2025-01-09 04:39:59,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229631714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:59,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:59,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:39:59,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122234852] [2025-01-09 04:39:59,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:59,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:39:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:59,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:39:59,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:39:59,195 INFO L87 Difference]: Start difference. First operand 4058 states and 5450 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:59,260 INFO L93 Difference]: Finished difference Result 4064 states and 5453 transitions. [2025-01-09 04:39:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:39:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:39:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:59,266 INFO L225 Difference]: With dead ends: 4064 [2025-01-09 04:39:59,266 INFO L226 Difference]: Without dead ends: 3565 [2025-01-09 04:39:59,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:39:59,268 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 539 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:59,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1008 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:39:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2025-01-09 04:39:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3561. [2025-01-09 04:39:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3561 states, 3560 states have (on average 1.347752808988764) internal successors, (4798), 3560 states have internal predecessors, (4798), 0 states have call successors, (0), 0 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 04:39:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 4798 transitions. [2025-01-09 04:39:59,295 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 4798 transitions. Word has length 69 [2025-01-09 04:39:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:59,295 INFO L471 AbstractCegarLoop]: Abstraction has 3561 states and 4798 transitions. [2025-01-09 04:39:59,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4798 transitions. [2025-01-09 04:39:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:39:59,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:59,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:59,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:39:59,298 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:59,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash -533504505, now seen corresponding path program 1 times [2025-01-09 04:39:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:59,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672549494] [2025-01-09 04:39:59,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:59,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:59,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:39:59,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:39:59,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:59,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:59,358 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 04:39:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672549494] [2025-01-09 04:39:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672549494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:59,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039539235] [2025-01-09 04:39:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:59,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:59,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:59,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:59,359 INFO L87 Difference]: Start difference. First operand 3561 states and 4798 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 04:39:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:59,387 INFO L93 Difference]: Finished difference Result 8305 states and 11340 transitions. [2025-01-09 04:39:59,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:59,388 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 04:39:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:59,393 INFO L225 Difference]: With dead ends: 8305 [2025-01-09 04:39:59,394 INFO L226 Difference]: Without dead ends: 5615 [2025-01-09 04:39:59,396 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 04:39:59,397 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 139 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:59,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 635 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2025-01-09 04:39:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 5297. [2025-01-09 04:39:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5297 states, 5296 states have (on average 1.3402567975830815) internal successors, (7098), 5296 states have internal predecessors, (7098), 0 states have call successors, (0), 0 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 04:39:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 7098 transitions. [2025-01-09 04:39:59,442 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 7098 transitions. Word has length 70 [2025-01-09 04:39:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:59,442 INFO L471 AbstractCegarLoop]: Abstraction has 5297 states and 7098 transitions. [2025-01-09 04:39:59,443 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 04:39:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 7098 transitions. [2025-01-09 04:39:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:39:59,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:59,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:39:59,445 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1110878122, now seen corresponding path program 1 times [2025-01-09 04:39:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:59,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828099551] [2025-01-09 04:39:59,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:59,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:39:59,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:39:59,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:59,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:59,536 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 04:39:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828099551] [2025-01-09 04:39:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828099551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:59,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:59,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042370619] [2025-01-09 04:39:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:59,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:59,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:59,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:59,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:59,538 INFO L87 Difference]: Start difference. First operand 5297 states and 7098 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:59,578 INFO L93 Difference]: Finished difference Result 13673 states and 18584 transitions. [2025-01-09 04:39:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:39:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:59,588 INFO L225 Difference]: With dead ends: 13673 [2025-01-09 04:39:59,589 INFO L226 Difference]: Without dead ends: 9285 [2025-01-09 04:39:59,594 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 04:39:59,595 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 120 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:59,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 629 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2025-01-09 04:39:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 8547. [2025-01-09 04:39:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8547 states, 8546 states have (on average 1.3433185115843669) internal successors, (11480), 8546 states have internal predecessors, (11480), 0 states have call successors, (0), 0 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 04:39:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 11480 transitions. [2025-01-09 04:39:59,678 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 11480 transitions. Word has length 71 [2025-01-09 04:39:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:59,678 INFO L471 AbstractCegarLoop]: Abstraction has 8547 states and 11480 transitions. [2025-01-09 04:39:59,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:39:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 11480 transitions. [2025-01-09 04:39:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:39:59,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:59,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:39:59,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:39:59,681 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:39:59,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash -396168239, now seen corresponding path program 1 times [2025-01-09 04:39:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:59,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277457140] [2025-01-09 04:39:59,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:59,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:59,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:39:59,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:39:59,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:59,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:59,741 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 04:39:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277457140] [2025-01-09 04:39:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277457140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295466795] [2025-01-09 04:39:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:59,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:59,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:59,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:59,743 INFO L87 Difference]: Start difference. First operand 8547 states and 11480 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:39:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:59,813 INFO L93 Difference]: Finished difference Result 23023 states and 31122 transitions. [2025-01-09 04:39:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:59,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 04:39:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:59,831 INFO L225 Difference]: With dead ends: 23023 [2025-01-09 04:39:59,831 INFO L226 Difference]: Without dead ends: 15385 [2025-01-09 04:39:59,841 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 04:39:59,842 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 102 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:59,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 614 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15385 states. [2025-01-09 04:39:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15385 to 13911. [2025-01-09 04:39:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13911 states, 13910 states have (on average 1.3357296908698777) internal successors, (18580), 13910 states have internal predecessors, (18580), 0 states have call successors, (0), 0 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 04:40:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13911 states to 13911 states and 18580 transitions. [2025-01-09 04:40:00,090 INFO L78 Accepts]: Start accepts. Automaton has 13911 states and 18580 transitions. Word has length 73 [2025-01-09 04:40:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:00,091 INFO L471 AbstractCegarLoop]: Abstraction has 13911 states and 18580 transitions. [2025-01-09 04:40:00,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:40:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13911 states and 18580 transitions. [2025-01-09 04:40:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:40:00,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:00,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:00,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:40:00,094 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1606128063, now seen corresponding path program 1 times [2025-01-09 04:40:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181299789] [2025-01-09 04:40:00,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:00,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:40:00,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:40:00,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:00,295 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 04:40:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181299789] [2025-01-09 04:40:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181299789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:00,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:00,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:40:00,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276986165] [2025-01-09 04:40:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:00,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:40:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:00,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:40:00,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:40:00,297 INFO L87 Difference]: Start difference. First operand 13911 states and 18580 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 04:40:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:00,369 INFO L93 Difference]: Finished difference Result 15257 states and 20373 transitions. [2025-01-09 04:40:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:40:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 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 04:40:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:00,388 INFO L225 Difference]: With dead ends: 15257 [2025-01-09 04:40:00,389 INFO L226 Difference]: Without dead ends: 15255 [2025-01-09 04:40:00,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:40:00,394 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:00,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1524 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15255 states. [2025-01-09 04:40:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15255 to 15255. [2025-01-09 04:40:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15255 states, 15254 states have (on average 1.3061492067654386) internal successors, (19924), 15254 states have internal predecessors, (19924), 0 states have call successors, (0), 0 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 04:40:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15255 states to 15255 states and 19924 transitions. [2025-01-09 04:40:00,537 INFO L78 Accepts]: Start accepts. Automaton has 15255 states and 19924 transitions. Word has length 75 [2025-01-09 04:40:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:00,537 INFO L471 AbstractCegarLoop]: Abstraction has 15255 states and 19924 transitions. [2025-01-09 04:40:00,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 04:40:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 15255 states and 19924 transitions. [2025-01-09 04:40:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:40:00,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:00,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:00,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:40:00,540 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:00,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 824153179, now seen corresponding path program 1 times [2025-01-09 04:40:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:00,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340498347] [2025-01-09 04:40:00,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:40:00,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:40:00,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:00,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:00,594 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 04:40:00,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:00,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340498347] [2025-01-09 04:40:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340498347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:00,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911973839] [2025-01-09 04:40:00,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:00,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:00,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:00,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:00,595 INFO L87 Difference]: Start difference. First operand 15255 states and 19924 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 04:40:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:00,709 INFO L93 Difference]: Finished difference Result 36835 states and 48094 transitions. [2025-01-09 04:40:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:00,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 04:40:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:00,733 INFO L225 Difference]: With dead ends: 36835 [2025-01-09 04:40:00,733 INFO L226 Difference]: Without dead ends: 22489 [2025-01-09 04:40:00,747 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 04:40:00,747 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 225 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:00,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 462 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22489 states. [2025-01-09 04:40:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22489 to 22487. [2025-01-09 04:40:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22487 states, 22486 states have (on average 1.289513475051143) internal successors, (28996), 22486 states have internal predecessors, (28996), 0 states have call successors, (0), 0 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 04:40:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22487 states to 22487 states and 28996 transitions. [2025-01-09 04:40:01,108 INFO L78 Accepts]: Start accepts. Automaton has 22487 states and 28996 transitions. Word has length 76 [2025-01-09 04:40:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:01,108 INFO L471 AbstractCegarLoop]: Abstraction has 22487 states and 28996 transitions. [2025-01-09 04:40:01,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 04:40:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 22487 states and 28996 transitions. [2025-01-09 04:40:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:40:01,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:01,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:01,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:40:01,111 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:01,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1756244585, now seen corresponding path program 1 times [2025-01-09 04:40:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541436809] [2025-01-09 04:40:01,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:01,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:40:01,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:40:01,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:01,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:01,176 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 04:40:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541436809] [2025-01-09 04:40:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541436809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894210910] [2025-01-09 04:40:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:01,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:01,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:01,178 INFO L87 Difference]: Start difference. First operand 22487 states and 28996 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 04:40:01,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:01,288 INFO L93 Difference]: Finished difference Result 32983 states and 42760 transitions. [2025-01-09 04:40:01,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:01,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:40:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:01,321 INFO L225 Difference]: With dead ends: 32983 [2025-01-09 04:40:01,322 INFO L226 Difference]: Without dead ends: 28121 [2025-01-09 04:40:01,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:01,335 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 698 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:01,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 987 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28121 states. [2025-01-09 04:40:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28121 to 25631. [2025-01-09 04:40:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25631 states, 25630 states have (on average 1.2866172454155287) internal successors, (32976), 25630 states have internal predecessors, (32976), 0 states have call successors, (0), 0 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 04:40:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25631 states to 25631 states and 32976 transitions. [2025-01-09 04:40:01,749 INFO L78 Accepts]: Start accepts. Automaton has 25631 states and 32976 transitions. Word has length 77 [2025-01-09 04:40:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:01,749 INFO L471 AbstractCegarLoop]: Abstraction has 25631 states and 32976 transitions. [2025-01-09 04:40:01,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 04:40:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 25631 states and 32976 transitions. [2025-01-09 04:40:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:40:01,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:01,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:01,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:40:01,752 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:01,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash -51175098, now seen corresponding path program 1 times [2025-01-09 04:40:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:01,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489599192] [2025-01-09 04:40:01,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:01,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:40:01,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:40:01,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:01,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:01,794 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 04:40:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489599192] [2025-01-09 04:40:01,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489599192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:01,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:01,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278174763] [2025-01-09 04:40:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:01,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:01,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:01,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:01,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:01,796 INFO L87 Difference]: Start difference. First operand 25631 states and 32976 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:02,128 INFO L93 Difference]: Finished difference Result 50506 states and 65016 transitions. [2025-01-09 04:40:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:02,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 04:40:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:02,168 INFO L225 Difference]: With dead ends: 50506 [2025-01-09 04:40:02,168 INFO L226 Difference]: Without dead ends: 37808 [2025-01-09 04:40:02,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:02,179 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 227 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:02,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 364 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37808 states. [2025-01-09 04:40:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37808 to 25134. [2025-01-09 04:40:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25134 states, 25133 states have (on average 1.283969283412247) internal successors, (32270), 25133 states have internal predecessors, (32270), 0 states have call successors, (0), 0 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 04:40:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25134 states to 25134 states and 32270 transitions. [2025-01-09 04:40:02,547 INFO L78 Accepts]: Start accepts. Automaton has 25134 states and 32270 transitions. Word has length 80 [2025-01-09 04:40:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:02,548 INFO L471 AbstractCegarLoop]: Abstraction has 25134 states and 32270 transitions. [2025-01-09 04:40:02,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 25134 states and 32270 transitions. [2025-01-09 04:40:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:40:02,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:02,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:02,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:40:02,556 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:02,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1593588101, now seen corresponding path program 1 times [2025-01-09 04:40:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:02,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151605424] [2025-01-09 04:40:02,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:02,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:40:02,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:40:02,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:02,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:40:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:02,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151605424] [2025-01-09 04:40:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151605424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:02,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:02,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:40:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160753329] [2025-01-09 04:40:02,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:40:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:02,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:40:02,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:40:02,883 INFO L87 Difference]: Start difference. First operand 25134 states and 32270 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:03,343 INFO L93 Difference]: Finished difference Result 48150 states and 61644 transitions. [2025-01-09 04:40:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:40:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:40:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:03,377 INFO L225 Difference]: With dead ends: 48150 [2025-01-09 04:40:03,377 INFO L226 Difference]: Without dead ends: 31720 [2025-01-09 04:40:03,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:03,394 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1127 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:03,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 862 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31720 states. [2025-01-09 04:40:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31720 to 25002. [2025-01-09 04:40:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25002 states, 25001 states have (on average 1.2843486260549577) internal successors, (32110), 25001 states have internal predecessors, (32110), 0 states have call successors, (0), 0 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 04:40:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25002 states to 25002 states and 32110 transitions. [2025-01-09 04:40:03,698 INFO L78 Accepts]: Start accepts. Automaton has 25002 states and 32110 transitions. Word has length 95 [2025-01-09 04:40:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:03,698 INFO L471 AbstractCegarLoop]: Abstraction has 25002 states and 32110 transitions. [2025-01-09 04:40:03,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25002 states and 32110 transitions. [2025-01-09 04:40:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:40:03,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:03,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:03,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:40:03,704 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:03,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 670186457, now seen corresponding path program 1 times [2025-01-09 04:40:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:03,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356922794] [2025-01-09 04:40:03,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:03,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:40:03,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:40:03,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:03,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356922794] [2025-01-09 04:40:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356922794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165256551] [2025-01-09 04:40:04,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:04,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:04,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:04,050 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 04:40:04,051 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 04:40:04,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:40:04,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:40:04,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:04,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:04,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:40:04,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:04,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165256551] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:05,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-01-09 04:40:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534822692] [2025-01-09 04:40:05,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:05,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:40:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:05,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:40:05,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:40:05,644 INFO L87 Difference]: Start difference. First operand 25002 states and 32110 transitions. Second operand has 26 states, 26 states have (on average 9.346153846153847) internal successors, (243), 25 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 04:40:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:07,011 INFO L93 Difference]: Finished difference Result 65592 states and 84264 transitions. [2025-01-09 04:40:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:40:07,012 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.346153846153847) internal successors, (243), 25 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:40:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:07,079 INFO L225 Difference]: With dead ends: 65592 [2025-01-09 04:40:07,079 INFO L226 Difference]: Without dead ends: 54898 [2025-01-09 04:40:07,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=542, Invalid=1714, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 04:40:07,101 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 3149 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3149 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:07,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3149 Valid, 2003 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:40:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54898 states. [2025-01-09 04:40:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54898 to 40651. [2025-01-09 04:40:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40651 states, 40650 states have (on average 1.2842066420664207) internal successors, (52203), 40650 states have internal predecessors, (52203), 0 states have call successors, (0), 0 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 04:40:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40651 states to 40651 states and 52203 transitions. [2025-01-09 04:40:07,633 INFO L78 Accepts]: Start accepts. Automaton has 40651 states and 52203 transitions. Word has length 95 [2025-01-09 04:40:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:07,633 INFO L471 AbstractCegarLoop]: Abstraction has 40651 states and 52203 transitions. [2025-01-09 04:40:07,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.346153846153847) internal successors, (243), 25 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 04:40:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 40651 states and 52203 transitions. [2025-01-09 04:40:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:40:07,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:07,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:07,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:40:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:07,843 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:07,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash -161019492, now seen corresponding path program 1 times [2025-01-09 04:40:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675058327] [2025-01-09 04:40:07,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:07,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:40:07,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:40:07,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675058327] [2025-01-09 04:40:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675058327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:08,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654588565] [2025-01-09 04:40:08,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:08,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:08,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:08,100 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 04:40:08,101 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 04:40:08,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:40:08,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:40:08,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:08,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:08,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 04:40:08,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:09,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654588565] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:09,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 27 [2025-01-09 04:40:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798100979] [2025-01-09 04:40:09,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:09,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:40:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:09,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:40:09,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:40:09,751 INFO L87 Difference]: Start difference. First operand 40651 states and 52203 transitions. Second operand has 27 states, 27 states have (on average 10.0) internal successors, (270), 27 states have internal predecessors, (270), 0 states have call successors, (0), 0 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 04:40:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:24,645 INFO L93 Difference]: Finished difference Result 268551 states and 341792 transitions. [2025-01-09 04:40:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2025-01-09 04:40:24,645 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.0) internal successors, (270), 27 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:40:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:24,973 INFO L225 Difference]: With dead ends: 268551 [2025-01-09 04:40:24,973 INFO L226 Difference]: Without dead ends: 228700 [2025-01-09 04:40:25,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32896 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=8513, Invalid=68493, Unknown=0, NotChecked=0, Total=77006 [2025-01-09 04:40:25,041 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 9325 mSDsluCounter, 8366 mSDsCounter, 0 mSdLazyCounter, 9212 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9325 SdHoareTripleChecker+Valid, 8963 SdHoareTripleChecker+Invalid, 9420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 9212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:25,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9325 Valid, 8963 Invalid, 9420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 9212 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 04:40:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228700 states. [2025-01-09 04:40:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228700 to 61326. [2025-01-09 04:40:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61326 states, 61325 states have (on average 1.2845495311863024) internal successors, (78775), 61325 states have internal predecessors, (78775), 0 states have call successors, (0), 0 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 04:40:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61326 states to 61326 states and 78775 transitions. [2025-01-09 04:40:26,686 INFO L78 Accepts]: Start accepts. Automaton has 61326 states and 78775 transitions. Word has length 96 [2025-01-09 04:40:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:26,686 INFO L471 AbstractCegarLoop]: Abstraction has 61326 states and 78775 transitions. [2025-01-09 04:40:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.0) internal successors, (270), 27 states have internal predecessors, (270), 0 states have call successors, (0), 0 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 04:40:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 61326 states and 78775 transitions. [2025-01-09 04:40:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:40:26,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:26,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:26,703 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 04:40:26,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:26,898 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:26,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1055139685, now seen corresponding path program 1 times [2025-01-09 04:40:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:26,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773033808] [2025-01-09 04:40:26,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:26,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:40:26,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:40:26,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:26,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773033808] [2025-01-09 04:40:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773033808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335559906] [2025-01-09 04:40:26,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:26,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:26,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:26,967 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 04:40:26,971 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 04:40:27,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:40:27,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:40:27,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:27,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:27,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:40:27,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:27,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335559906] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:27,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:27,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:40:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105604648] [2025-01-09 04:40:27,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:27,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:40:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:27,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:40:27,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:40:27,542 INFO L87 Difference]: Start difference. First operand 61326 states and 78775 transitions. Second operand has 14 states, 14 states have (on average 18.5) internal successors, (259), 14 states have internal predecessors, (259), 0 states have call successors, (0), 0 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 04:40:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:28,269 INFO L93 Difference]: Finished difference Result 138644 states and 177801 transitions. [2025-01-09 04:40:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:40:28,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.5) internal successors, (259), 14 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:40:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:28,373 INFO L225 Difference]: With dead ends: 138644 [2025-01-09 04:40:28,374 INFO L226 Difference]: Without dead ends: 78080 [2025-01-09 04:40:28,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:28,424 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1376 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:28,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 948 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78080 states. [2025-01-09 04:40:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78080 to 65204. [2025-01-09 04:40:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65204 states, 65203 states have (on average 1.262625952793583) internal successors, (82327), 65203 states have internal predecessors, (82327), 0 states have call successors, (0), 0 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 04:40:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65204 states to 65204 states and 82327 transitions. [2025-01-09 04:40:29,497 INFO L78 Accepts]: Start accepts. Automaton has 65204 states and 82327 transitions. Word has length 97 [2025-01-09 04:40:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:29,497 INFO L471 AbstractCegarLoop]: Abstraction has 65204 states and 82327 transitions. [2025-01-09 04:40:29,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.5) internal successors, (259), 14 states have internal predecessors, (259), 0 states have call successors, (0), 0 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 04:40:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 65204 states and 82327 transitions. [2025-01-09 04:40:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:40:29,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:29,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:29,515 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 04:40:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:29,708 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash -245080703, now seen corresponding path program 1 times [2025-01-09 04:40:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477555434] [2025-01-09 04:40:29,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:29,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:40:29,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:40:29,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:29,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:29,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477555434] [2025-01-09 04:40:29,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477555434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:29,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:29,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555347051] [2025-01-09 04:40:29,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:29,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:29,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:29,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:29,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:29,836 INFO L87 Difference]: Start difference. First operand 65204 states and 82327 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 04:40:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:30,752 INFO L93 Difference]: Finished difference Result 131314 states and 165554 transitions. [2025-01-09 04:40:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:40:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 04:40:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:30,835 INFO L225 Difference]: With dead ends: 131314 [2025-01-09 04:40:30,836 INFO L226 Difference]: Without dead ends: 66937 [2025-01-09 04:40:30,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:30,864 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 479 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:30,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 461 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66937 states. [2025-01-09 04:40:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66937 to 63103. [2025-01-09 04:40:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63103 states, 63102 states have (on average 1.2412918766441634) internal successors, (78328), 63102 states have internal predecessors, (78328), 0 states have call successors, (0), 0 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 04:40:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63103 states to 63103 states and 78328 transitions. [2025-01-09 04:40:32,001 INFO L78 Accepts]: Start accepts. Automaton has 63103 states and 78328 transitions. Word has length 98 [2025-01-09 04:40:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:32,001 INFO L471 AbstractCegarLoop]: Abstraction has 63103 states and 78328 transitions. [2025-01-09 04:40:32,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 04:40:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 63103 states and 78328 transitions. [2025-01-09 04:40:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 04:40:32,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:32,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:32,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:40:32,011 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:32,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1636973892, now seen corresponding path program 1 times [2025-01-09 04:40:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:32,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025429183] [2025-01-09 04:40:32,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:32,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:32,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 04:40:32,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 04:40:32,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:32,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:40:32,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025429183] [2025-01-09 04:40:32,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025429183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:32,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:32,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846859799] [2025-01-09 04:40:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:32,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:32,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:32,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:32,085 INFO L87 Difference]: Start difference. First operand 63103 states and 78328 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:40:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:32,416 INFO L93 Difference]: Finished difference Result 94709 states and 118252 transitions. [2025-01-09 04:40:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-01-09 04:40:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:32,503 INFO L225 Difference]: With dead ends: 94709 [2025-01-09 04:40:32,503 INFO L226 Difference]: Without dead ends: 75753 [2025-01-09 04:40:32,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:32,533 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 584 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:32,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 773 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75753 states. [2025-01-09 04:40:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75753 to 73227. [2025-01-09 04:40:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73227 states, 73226 states have (on average 1.2363914456613772) internal successors, (90536), 73226 states have internal predecessors, (90536), 0 states have call successors, (0), 0 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 04:40:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73227 states to 73227 states and 90536 transitions. [2025-01-09 04:40:33,255 INFO L78 Accepts]: Start accepts. Automaton has 73227 states and 90536 transitions. Word has length 101 [2025-01-09 04:40:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:33,255 INFO L471 AbstractCegarLoop]: Abstraction has 73227 states and 90536 transitions. [2025-01-09 04:40:33,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:40:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 73227 states and 90536 transitions. [2025-01-09 04:40:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:40:33,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:33,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:33,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:40:33,264 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:33,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1477417838, now seen corresponding path program 1 times [2025-01-09 04:40:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611709877] [2025-01-09 04:40:33,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:33,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:33,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:40:33,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:40:33,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:33,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:33,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611709877] [2025-01-09 04:40:33,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611709877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:33,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:33,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542130888] [2025-01-09 04:40:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:33,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:33,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:33,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:33,336 INFO L87 Difference]: Start difference. First operand 73227 states and 90536 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:40:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:33,529 INFO L93 Difference]: Finished difference Result 95929 states and 119188 transitions. [2025-01-09 04:40:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-09 04:40:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:33,842 INFO L225 Difference]: With dead ends: 95929 [2025-01-09 04:40:33,843 INFO L226 Difference]: Without dead ends: 84293 [2025-01-09 04:40:33,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:33,856 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 584 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:33,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 757 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84293 states. [2025-01-09 04:40:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84293 to 81767. [2025-01-09 04:40:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81767 states, 81766 states have (on average 1.2342783063865177) internal successors, (100922), 81766 states have internal predecessors, (100922), 0 states have call successors, (0), 0 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 04:40:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81767 states to 81767 states and 100922 transitions. [2025-01-09 04:40:34,726 INFO L78 Accepts]: Start accepts. Automaton has 81767 states and 100922 transitions. Word has length 102 [2025-01-09 04:40:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:34,726 INFO L471 AbstractCegarLoop]: Abstraction has 81767 states and 100922 transitions. [2025-01-09 04:40:34,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:40:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 81767 states and 100922 transitions. [2025-01-09 04:40:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:40:34,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:34,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:34,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:40:34,739 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:34,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1197851110, now seen corresponding path program 1 times [2025-01-09 04:40:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:34,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921620126] [2025-01-09 04:40:34,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:34,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:40:34,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:40:34,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:34,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:40:34,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:34,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921620126] [2025-01-09 04:40:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921620126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:34,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:40:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967942602] [2025-01-09 04:40:34,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:40:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:34,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:40:34,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:34,825 INFO L87 Difference]: Start difference. First operand 81767 states and 100922 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:40:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:35,404 INFO L93 Difference]: Finished difference Result 119613 states and 146495 transitions. [2025-01-09 04:40:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:40:35,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:40:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:35,518 INFO L225 Difference]: With dead ends: 119613 [2025-01-09 04:40:35,518 INFO L226 Difference]: Without dead ends: 105981 [2025-01-09 04:40:35,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:40:35,552 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1189 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:35,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 496 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105981 states. [2025-01-09 04:40:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105981 to 81817. [2025-01-09 04:40:36,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81817 states, 81816 states have (on average 1.234208467781363) internal successors, (100978), 81816 states have internal predecessors, (100978), 0 states have call successors, (0), 0 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 04:40:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81817 states to 81817 states and 100978 transitions. [2025-01-09 04:40:36,643 INFO L78 Accepts]: Start accepts. Automaton has 81817 states and 100978 transitions. Word has length 105 [2025-01-09 04:40:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:36,643 INFO L471 AbstractCegarLoop]: Abstraction has 81817 states and 100978 transitions. [2025-01-09 04:40:36,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:40:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 81817 states and 100978 transitions. [2025-01-09 04:40:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:40:36,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:36,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:36,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:40:36,660 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2136410995, now seen corresponding path program 1 times [2025-01-09 04:40:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331144621] [2025-01-09 04:40:36,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:36,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:40:36,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:40:36,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:36,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331144621] [2025-01-09 04:40:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331144621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498719187] [2025-01-09 04:40:36,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:36,737 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 04:40:36,738 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 04:40:36,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:40:36,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:40:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:36,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:40:36,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:37,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498719187] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:37,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:40:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13931678] [2025-01-09 04:40:37,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:37,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:40:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:37,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:40:37,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:40:37,332 INFO L87 Difference]: Start difference. First operand 81817 states and 100978 transitions. Second operand has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 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 04:40:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:38,215 INFO L93 Difference]: Finished difference Result 170975 states and 211027 transitions. [2025-01-09 04:40:38,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:40:38,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-01-09 04:40:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:38,320 INFO L225 Difference]: With dead ends: 170975 [2025-01-09 04:40:38,320 INFO L226 Difference]: Without dead ends: 90079 [2025-01-09 04:40:38,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:38,343 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1908 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 809 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90079 states. [2025-01-09 04:40:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90079 to 78013. [2025-01-09 04:40:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78013 states, 78012 states have (on average 1.2138132594985387) internal successors, (94692), 78012 states have internal predecessors, (94692), 0 states have call successors, (0), 0 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 04:40:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78013 states to 78013 states and 94692 transitions. [2025-01-09 04:40:39,305 INFO L78 Accepts]: Start accepts. Automaton has 78013 states and 94692 transitions. Word has length 106 [2025-01-09 04:40:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:39,306 INFO L471 AbstractCegarLoop]: Abstraction has 78013 states and 94692 transitions. [2025-01-09 04:40:39,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.857142857142858) internal successors, (292), 14 states have internal predecessors, (292), 0 states have call successors, (0), 0 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 04:40:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 78013 states and 94692 transitions. [2025-01-09 04:40:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:40:39,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:39,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:39,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:40:39,517 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,SelfDestructingSolverStorable37 [2025-01-09 04:40:39,517 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1676684851, now seen corresponding path program 1 times [2025-01-09 04:40:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915023893] [2025-01-09 04:40:39,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:39,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:40:39,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:40:39,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:39,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:40:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915023893] [2025-01-09 04:40:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915023893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109807447] [2025-01-09 04:40:39,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:40:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:39,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:40:39,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:40:39,562 INFO L87 Difference]: Start difference. First operand 78013 states and 94692 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:40,441 INFO L93 Difference]: Finished difference Result 193945 states and 236130 transitions. [2025-01-09 04:40:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-01-09 04:40:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:40,567 INFO L225 Difference]: With dead ends: 193945 [2025-01-09 04:40:40,568 INFO L226 Difference]: Without dead ends: 121749 [2025-01-09 04:40:40,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:40:40,591 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 169 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:40,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 549 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121749 states. [2025-01-09 04:40:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121749 to 81932. [2025-01-09 04:40:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81932 states, 81931 states have (on average 1.21544958562693) internal successors, (99583), 81931 states have internal predecessors, (99583), 0 states have call successors, (0), 0 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 04:40:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81932 states to 81932 states and 99583 transitions. [2025-01-09 04:40:41,760 INFO L78 Accepts]: Start accepts. Automaton has 81932 states and 99583 transitions. Word has length 106 [2025-01-09 04:40:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 81932 states and 99583 transitions. [2025-01-09 04:40:41,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 81932 states and 99583 transitions. [2025-01-09 04:40:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 04:40:41,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:41,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:40:41,770 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash 74215128, now seen corresponding path program 1 times [2025-01-09 04:40:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004182244] [2025-01-09 04:40:41,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:41,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 04:40:41,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 04:40:41,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:41,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004182244] [2025-01-09 04:40:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004182244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:42,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:42,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:40:42,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179888361] [2025-01-09 04:40:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:40:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:42,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:40:42,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:40:42,069 INFO L87 Difference]: Start difference. First operand 81932 states and 99583 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 04:40:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:43,051 INFO L93 Difference]: Finished difference Result 162482 states and 197338 transitions. [2025-01-09 04:40:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:40:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-01-09 04:40:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:43,216 INFO L225 Difference]: With dead ends: 162482 [2025-01-09 04:40:43,216 INFO L226 Difference]: Without dead ends: 126488 [2025-01-09 04:40:43,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:40:43,260 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 925 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:43,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 983 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126488 states. [2025-01-09 04:40:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126488 to 122920. [2025-01-09 04:40:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122920 states, 122919 states have (on average 1.2152474393706425) internal successors, (149377), 122919 states have internal predecessors, (149377), 0 states have call successors, (0), 0 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 04:40:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122920 states to 122920 states and 149377 transitions. [2025-01-09 04:40:44,472 INFO L78 Accepts]: Start accepts. Automaton has 122920 states and 149377 transitions. Word has length 106 [2025-01-09 04:40:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:44,472 INFO L471 AbstractCegarLoop]: Abstraction has 122920 states and 149377 transitions. [2025-01-09 04:40:44,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 04:40:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 122920 states and 149377 transitions. [2025-01-09 04:40:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:40:44,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:44,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:44,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:40:44,485 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:44,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash 768006085, now seen corresponding path program 1 times [2025-01-09 04:40:44,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:44,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069537369] [2025-01-09 04:40:44,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:40:44,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:40:44,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:40:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:44,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069537369] [2025-01-09 04:40:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069537369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:44,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:44,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:40:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938210147] [2025-01-09 04:40:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:44,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:40:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:44,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:40:44,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:40:44,985 INFO L87 Difference]: Start difference. First operand 122920 states and 149377 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:40:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:45,613 INFO L93 Difference]: Finished difference Result 201246 states and 244332 transitions. [2025-01-09 04:40:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:40:45,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-01-09 04:40:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:45,759 INFO L225 Difference]: With dead ends: 201246 [2025-01-09 04:40:45,759 INFO L226 Difference]: Without dead ends: 123131 [2025-01-09 04:40:45,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:40:45,830 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 976 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:45,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 706 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123131 states. [2025-01-09 04:40:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123131 to 122863. [2025-01-09 04:40:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122863 states, 122862 states have (on average 1.2152821865182075) internal successors, (149312), 122862 states have internal predecessors, (149312), 0 states have call successors, (0), 0 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 04:40:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122863 states to 122863 states and 149312 transitions. [2025-01-09 04:40:47,588 INFO L78 Accepts]: Start accepts. Automaton has 122863 states and 149312 transitions. Word has length 107 [2025-01-09 04:40:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:47,588 INFO L471 AbstractCegarLoop]: Abstraction has 122863 states and 149312 transitions. [2025-01-09 04:40:47,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:40:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 122863 states and 149312 transitions. [2025-01-09 04:40:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:40:47,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:47,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:47,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:40:47,600 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:47,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1802251620, now seen corresponding path program 1 times [2025-01-09 04:40:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925610894] [2025-01-09 04:40:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:47,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:40:47,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:40:47,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:47,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:40:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925610894] [2025-01-09 04:40:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925610894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:47,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:47,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:47,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734279032] [2025-01-09 04:40:47,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:47,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:47,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:47,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:47,642 INFO L87 Difference]: Start difference. First operand 122863 states and 149312 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:40:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:47,941 INFO L93 Difference]: Finished difference Result 159466 states and 193887 transitions. [2025-01-09 04:40:47,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:47,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 108 [2025-01-09 04:40:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:48,073 INFO L225 Difference]: With dead ends: 159466 [2025-01-09 04:40:48,073 INFO L226 Difference]: Without dead ends: 115011 [2025-01-09 04:40:48,119 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 04:40:48,122 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 190 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:48,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 351 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115011 states. [2025-01-09 04:40:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115011 to 114881. [2025-01-09 04:40:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114881 states, 114880 states have (on average 1.2120038300835654) internal successors, (139235), 114880 states have internal predecessors, (139235), 0 states have call successors, (0), 0 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 04:40:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114881 states to 114881 states and 139235 transitions. [2025-01-09 04:40:49,668 INFO L78 Accepts]: Start accepts. Automaton has 114881 states and 139235 transitions. Word has length 108 [2025-01-09 04:40:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 114881 states and 139235 transitions. [2025-01-09 04:40:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:40:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 114881 states and 139235 transitions. [2025-01-09 04:40:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:40:49,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:49,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:49,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:40:49,675 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:49,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash 587799882, now seen corresponding path program 1 times [2025-01-09 04:40:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:49,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305074760] [2025-01-09 04:40:49,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:49,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:40:49,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:40:49,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:49,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305074760] [2025-01-09 04:40:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305074760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:50,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383133949] [2025-01-09 04:40:50,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:50,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:50,390 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 04:40:50,393 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 04:40:50,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:40:50,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:40:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:50,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 04:40:50,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:51,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383133949] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:52,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 11] total 37 [2025-01-09 04:40:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948526960] [2025-01-09 04:40:52,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:52,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 04:40:52,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:52,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 04:40:52,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 04:40:52,140 INFO L87 Difference]: Start difference. First operand 114881 states and 139235 transitions. Second operand has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 0 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 04:40:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:57,221 INFO L93 Difference]: Finished difference Result 165693 states and 200029 transitions. [2025-01-09 04:40:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-01-09 04:40:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 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 108 [2025-01-09 04:40:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:57,463 INFO L225 Difference]: With dead ends: 165693 [2025-01-09 04:40:57,463 INFO L226 Difference]: Without dead ends: 139779 [2025-01-09 04:40:57,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3104 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2190, Invalid=10242, Unknown=0, NotChecked=0, Total=12432 [2025-01-09 04:40:57,518 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 3566 mSDsluCounter, 7242 mSDsCounter, 0 mSdLazyCounter, 3473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3566 SdHoareTripleChecker+Valid, 7637 SdHoareTripleChecker+Invalid, 3534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:57,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3566 Valid, 7637 Invalid, 3534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3473 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:40:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139779 states. [2025-01-09 04:40:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139779 to 115132. [2025-01-09 04:40:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115132 states, 115131 states have (on average 1.2102995717921325) internal successors, (139343), 115131 states have internal predecessors, (139343), 0 states have call successors, (0), 0 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 04:40:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115132 states to 115132 states and 139343 transitions. [2025-01-09 04:40:59,026 INFO L78 Accepts]: Start accepts. Automaton has 115132 states and 139343 transitions. Word has length 108 [2025-01-09 04:40:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 115132 states and 139343 transitions. [2025-01-09 04:40:59,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.162162162162161) internal successors, (302), 37 states have internal predecessors, (302), 0 states have call successors, (0), 0 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 04:40:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 115132 states and 139343 transitions. [2025-01-09 04:40:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:40:59,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:59,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:59,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:40:59,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:59,237 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -17084980, now seen corresponding path program 1 times [2025-01-09 04:40:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594687725] [2025-01-09 04:40:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:59,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:40:59,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:40:59,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:59,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:40:59,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:59,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594687725] [2025-01-09 04:40:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594687725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:59,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:59,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127534096] [2025-01-09 04:40:59,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:59,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:40:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:59,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:40:59,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:40:59,291 INFO L87 Difference]: Start difference. First operand 115132 states and 139343 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 04:40:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:59,857 INFO L93 Difference]: Finished difference Result 200836 states and 242316 transitions. [2025-01-09 04:40:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:59,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 109 [2025-01-09 04:40:59,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:00,045 INFO L225 Difference]: With dead ends: 200836 [2025-01-09 04:41:00,046 INFO L226 Difference]: Without dead ends: 165161 [2025-01-09 04:41:00,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:41:00,099 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 131 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:00,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 533 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:41:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165161 states. [2025-01-09 04:41:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165161 to 132684. [2025-01-09 04:41:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132684 states, 132683 states have (on average 1.2110820527121033) internal successors, (160690), 132683 states have internal predecessors, (160690), 0 states have call successors, (0), 0 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 04:41:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132684 states to 132684 states and 160690 transitions. [2025-01-09 04:41:01,993 INFO L78 Accepts]: Start accepts. Automaton has 132684 states and 160690 transitions. Word has length 109 [2025-01-09 04:41:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:01,993 INFO L471 AbstractCegarLoop]: Abstraction has 132684 states and 160690 transitions. [2025-01-09 04:41:01,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 04:41:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 132684 states and 160690 transitions. [2025-01-09 04:41:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:41:02,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:02,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:41:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 04:41:02,001 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:02,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 619476935, now seen corresponding path program 1 times [2025-01-09 04:41:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:02,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597890047] [2025-01-09 04:41:02,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:02,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:41:02,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:41:02,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:02,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:02,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597890047] [2025-01-09 04:41:02,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597890047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:41:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500958284] [2025-01-09 04:41:02,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:41:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:41:02,526 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 04:41:02,526 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 04:41:02,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:41:02,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:41:02,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:02,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 04:41:02,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:41:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:03,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:41:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:04,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500958284] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:41:04,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:41:04,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 34 [2025-01-09 04:41:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382458733] [2025-01-09 04:41:04,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:41:04,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 04:41:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:04,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 04:41:04,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:41:04,242 INFO L87 Difference]: Start difference. First operand 132684 states and 160690 transitions. Second operand has 34 states, 34 states have (on average 9.029411764705882) internal successors, (307), 34 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)